Sum of powers 2

Very easy

Execution time limit is 2 seconds

Runtime memory usage limit is 128 megabytes

Find the sum $(1^{1} + 2^{2} + 3^{3} + .... + n^{n}) m o d m$ .

Input

Two positive integers $n$ and $m (n, m \leq 1 0^{6})$ .

Print the value of the sum modulo $m$ .

Input #1

Answer #1

Submissions 1K

Acceptance rate 33%