On Getting Pigeonholed

Here n (= 10) pigeons in m (= 9) holes, so that some hole has more than one pigeon.

In Mathematics And Computer Science, The Pigeonhole Principle States That If n Items Are Put Into m Pigeonholes With n > m, Then At Least One Pigeonhole Must Contain More Than One Item.