A combinatoric Le Monde mathematical puzzle that resembles many earlier ones: Given a pool of 30 interns allocated to three person night-shifts, is it possible to see 31 consecutive nights such that (a) all the shifts differ and (b) there are no pair of shifts with a single common intern? In fact, the constraint there