P1593 Sum of Divisors
Description
Given two integers $a$ and $b$, compute the sum of divisors of $a^b$.
Since the result can be very large, output it modulo $9901$.
Input Format
A single line containing two integers $a$ and $b$.
Output Format
Output a single line with one integer, the answer modulo $9901$.
Explanation/Hint
#### Constraints
For all testdata, it is guaranteed that $1 \leq a \leq 5 \times 10^7$, $0 \leq b \leq 5 \times 10^7$.
Translated by ChatGPT 5