### Pro-Test Voting

Time Limit: 1000 ms
Memory Limit: 60000 KiB

#### Problem Description

Old Bob Test is currently running for Mayor in the Hamlet of Kerning. Kerning is divided up into a number of precincts (numbered 0, 1, 2, ...), and after extensive polling by his crack staff, Bob knows the current percentage of voters in each precinct who plan to vote for him. Needless to say, he would like to increase these percentages in all precincts, but he has limited funds to spend. Based on past results, the effects of spending on any precinct obey the following equation:

where Ip is the current percentage of pro-Test voters, ∆ is the maximum increase in this percentage possible, M is the amount of money spent in the precinct, in integer multiples of $1, and Fp is the final expected percentage. What Bob needs to know is the best way to spend his money to maximize the number of votes he can get.

#### Input

The first line of each test case contains two integers m and n, representing the amount of money Bob has to spend (in dollars) and the number of precincts. The maximum value for both of these is 100.

After this will be n lines of the form N Ip ∆, all positive integers, which contain information on each precinct: N is the population of the precinct and Ip and ∆ are as described above. The value of N will be less than 10000. The first of these lines refers to precinct 0, the next to precinct 1, and so on. A line containing 0 0 follows the last test case. NOTE: When calculating the number of pro-Test voters in a precinct, you should first perform a double calculation of Fp using the formula above, then multiply this percentage by the population N and round to get the final result.

#### Output

Output for each test case should consist of two lines. The first should contain the case number followed by the maximum number of votes Bob can obtain through optimum spending. The second line should list each precinct and the amount of money which Bob should spend there. The format for each precinct should be precinctnum:money, and each such pair should be separated by 1 blank. In the case where there is more than one way to spend Bob’s money that yields the maximum number of votes, give the one that spends the most on precinct 0. If there is more than one with the same spent on precinct 0, take the one that spends the most on precinct 1, etc.

#### Sample Input

100 2 3000 45 15 2000 60 10 100 3 3000 45 15 2000 60 10 4000 20 8 100 3 3000 45 15 2000 60 10 4000 20 7 100 3 3000 45 15 2000 60 10 4000 20 6 100 3 3000 45 15 2000 60 10 4000 20 5 0 0

#### Sample Output

Case 1: 3095 0:64 1:36 Case 2: 4101 0:42 1:24 2:34 Case 3: 4070 0:45 1:27 2:28 Case 4: 4040 0:46 1:27 2:27 Case 5: 4011 0:46 1:27 2:27