Given the integers n and p, compute n^n \bmod 10^p.
You will be provided with two integers n and p (1 \leq n \leq 10^9, 1 \leq p \leq 100).
Print a single integer representing n^n \bmod 10^p.
Example 1