Hidden Truth in Recurrence

You are given a recursive function, which has the following form:

Now, you have to find: , where m = 10t.

Input

Each line will contain three integers: k (0 < k < 10^19), n (0 < n < 10^19) and t (0 < t < 10). Input will be terminated by three zeros for the value of k, n and t. You must not process this case.

Output

For each line output the test case and the value of x. The output should be in the format shown in the sample output.

Examples