시간 제한메모리 제한제출정답맞힌 사람정답 비율
1 초 1024 MB62241325.490%

문제

Dr. Ceizenpok from planet i1c5l became famous across the whole Universe thanks to his recent discovery --- the Ceizenpok’s formula. This formula has only three arguments: $n$, $k$ and $m$, and its value is a number of $k$-combinations of a set of $n$ modulo $m$.

While the whole Universe is trying to guess what the formula is useful for, we need to automate its calculation.

입력

Single line contains three integers $n$, $k$, $m$, separated with spaces ($1 \le n \le 10^{18}$, $0 \le k \le n$, $2 \le m \le 1\,000\,000$).

출력

Write the formula value for given arguments $n$, $k$, $m$.

예제 입력 1

2 1 3

예제 출력 1

2

예제 입력 2

4 2 5

예제 출력 2

1