You are given a recursive function, which has the following form: Input f(0,0) = 1 k−1 f (n, r) = f (n − 1, r − i) i=0 f (n, r) = 0 Now, you have to find: otherwise n(k−1) ∑ i=0 ∑ x = f(n,i) mod m, where m = 102 when [(n > 0) and (0 ≤ r < n(k − 1) + 1)] A partially filled table for k = 3 There will be less than 1001 lines of inputs in the input file. Each line will contain three integers: k (0<k<1019),n(0<n<1019)andt(0<t<10). Inputwillbeterminatedbythreezerosforthe value of k, n and t. You must not process this case. Output For each line of input, output the value of x. The output should be in the format shown in the sample output. Sample Input 1234 1234 4 2323 99999999999 8 4 99999 9 888 888 8 000
2/2 Sample Output Case #1: 736 Case #2: 39087387 Case #3: 494777344 Case #4: 91255296