Not meant to be hard but requires one insight.

In "What Time Is It Mr. Fox", one player is the fox and the other are sheep. At regular intervals, the fox announces a time of day (in hours), e.g. 1 o'clock, 11 o'clock, etc., or announces it is lunch time. The fox starts on one end of the playing field and all sheep start at the other end.

For each sheep i there is an array a[i][t] of positive values for t = 1, ..., 11.
When the fox declares it is "h" o'clock, sheep i takes a[i][t] steps forward.

When the fox declares it is lunch time, all sheep run back to their starting point: sheep i runs at a speed of s[i]. But the fox is fast (i.e. has speed f), if they catch a sheep before they run back to their starting point then they are eaten. If multiple sheep can be reached by the fox, they pick the lowest i among all sheep and eliminate that sheep. Whether they catch a sheep or not, they go back to their starting position.

This process repeats for a while (i.e. a series of instructions is called). For each "lunch time" call, indicate the index of the sheep that is eaten or declare all remaiing sheep are safe that time.

Bounds:
# sheep <= 100,000
# instructions <= 100,000
# lunch time calls <= 100