eolymp
bolt
Try our new interface for solving problems
Problems

Binomial coefficients 4

Binomial coefficients 4

Time limit 2 seconds
Memory limit 64 MiB

You are given non-negative integers n, k, m. Find the number C(n,k) modulo m.

Input The first and only line of the input file contains non-negative integers n, k, m separated by spaces. This numbers satisfy the inequalities 1<=n<=10^18, 0<=k<=min(n,200000), 1<=m<=2000000000. Output The first and only line of the output file should contain required number C(n,k) modulo m.

Examples

Input example #1
6 3 14
Output example #1
6
Author Anton Lunev