Time Limit: 1000MS
Memory Limit: 30000K
Consider two natural numbers A and B. Let S be the sum of all natural divisors of A^B. Determine S modulo 9901 (the rest of the division of S by 9901).
The only line contains the two natural numbers A and B, (0 <= A,B <= 50000000)separated by blanks.
The only line of the output will contain S modulo 9901.
2^3 = 8.
The natural divisors of 8 are: 1,2,4,8. Their sum is 15.
15 modulo 9901 is 15 (that should be output).