Help-or-else#3049
A penal colony for finance professionals will soon hold its annual community service event, with rules suitable for such a colony. Each inmate is assigned a set of people to help with their finances and a time limit of minutes. For each person (1 \leq j \leq N), the inmate is informed of a penalty time e_j for not helping them, and a time duration of d_j minutes required to help. The inmate starts community service at time T = 0. If the inmate starts helping person at time , they must finish by T + d_j. Regardless of the advice quality and completion time, C_j (= T + d_j) is deducted from the inmate's allotted minutes. The inmate cannot help another person until time T + d_j. If is the set of people helped, then the total number of minutes used is the sum of all C_j for those helped.
Your task is to write a program that calculates the maximum number of people an inmate can help without exceeding the -minute limit.
The input consists of sets for many inmates. The description of each inmate begins with two integers and separated by a single space, where is the number of people and is the maximum allowed minutes. 0 < N \leq 200, 0 < K \leq 6000. Each of the next lines contains two integers, separated by a single space, representing the penalty and time duration for one person to be assisted. All integers are between and inclusive. Input terminates with two zeros on a line by themselves.
For each inmate, output a single line containing the maximum number of people who can be helped without exceeding the time limit. If it is not possible to help anyone without exceeding the limit, output Mission Impossible.
Example 1