Consider the following game. There are n people standing in a queue, and there are m n closed boxes, k of the boxes contain prizes. Each next person in the queue can open any box and if it contains a prize this person will receive the prize. One person can open only one box. What is the best position in the queue to maximize the probability of winning a prize? Hint: try to compute this probability for the first and the second positions in the queue.