Hidden Truth in Recurrence#1514
A recursive function is given as follows:
Calculate the value , where m = 10^t.
Each line contains three integers: (0 < k < 10^{19}), (0 < n < 10^{19}), and (0 < t < 10). The last line contains three zeros and must not be processed.
For each test case, output the test case number and the value of on a separate line. The output format is shown in the sample.
Example 1