In combinatorics there is a classic problem about a "hat check," where patrons submit their hats, return slips are lost, and people get them back willy nilly. People get sad, angry, happy, you name it! In fact, as the number of people checking hats goes to infinity, the probability that NO ONE gets their hat back goes to 1/e! Well, here at the U of M math department, we are all about generalizations. Therefore, we present to you: The 1st annual AMS Sock Derangement! (a generalization of the AMS hat check)