Loan

Time Limit: 1 Second    Memory Limit: 32768 KB

Mr. Smith received a loan for Q dollars. He plans to pay off this loan in K years at an interest rate of P percent per year. That means that, after each year, Mr. Smith's debt grows by P*Q'/100 dollars (Q' being the debt at the beginning of that year) and his annual payment is deducted from his debt.

For the first year, Mr. Smith wants to pay minimal amount that will allow him to pay off the loan within exactly K years. For each subsequent year, he is willing to pay either the same amount as the previous year or one cent less than the previous year's payment. He wants the loan to be completely paid off without overpayment of even a single cent by the end of the Kth year.

The bank performs all transactions with a precision of one cent, and calculates interest due at the end of each year. Whenever interest is calculated, the result is immediately rounded to the nearest cent, with 0.5 cents rounded up.

Input

The input contains a single line with three numbers Q, P and K, separated by spaces. Q is a real number (10 <= Q <= 1000000) given with no more than two digits to the right of the decimal point. This value represents the amount of the loan in dollars. One one-hundredth of a dollar is a cent. P and K are integers (0 <= P <= 100, 1 <= K <= 100).

This problem contains multiple test cases!

The first line of a multiple input is an integer N, then a blank line followed by N input blocks. Each input block is in the format indicated in the problem description. There is a blank line between input blocks.

Output

Write to the output a schedule of payments for Mr. Smith. You should write the amount of each payment and number of years that payment should be made, thus effectively grouping equal payments. Each group of equal payments must be written on separate line, with no blank lines between them. The output format for each group of payments is:

\$X for Y year(s)

where X is payment amount in dollars printed with exactly two digits after decimal point. Y is a number of years for which this payment should be made. The dollar value given on each line must be one cent less than the dollar value printed above it.

If there are multiple correct payment schedules, you can output any one of them, but the first payment should be the minimal possible one. If no solution can be found for the given input, then the output shall contain only the word "Impossible".

The output format consists of N output blocks. There is a blank line between output blocks.

3

100 100 100

20 0 10

939850.83 85 35

Sample Output

Impossible

\$2.00 for 10 year(s)

\$798873.22 for 1 year(s)
\$798873.21 for 1 year(s)
\$798873.20 for 1 year(s)
\$798873.19 for 1 year(s)
\$798873.18 for 1 year(s)
\$798873.17 for 4 year(s)
\$798873.16 for 1 year(s)
\$798873.15 for 2 year(s)
\$798873.14 for 1 year(s)
\$798873.13 for 3 year(s)
\$798873.12 for 1 year(s)
\$798873.11 for 4 year(s)
\$798873.10 for 2 year(s)
\$798873.09 for 7 year(s)
\$798873.08 for 2 year(s)
\$798873.07 for 1 year(s)
\$798873.06 for 1 year(s)
\$798873.05 for 1 year(s)
Submit

Source: Northeastern Europe 1999