e-olymp
favorite We need a little bit of your help to keep things running, click on this banner to learn more
Problems

Nicholas Problem

Nicholas Problem

prb513

Nicholas must deliver gifts to n (n1018) children. He wonders in how many ways he can do it. You need to answer this simple question. Since this number may be very large, print the result modulo m (m2009).

Input

Two positive integers n and m.

Output

Print the number of possible ways deliver presents.

Time limit 1 second
Memory limit 128 MiB
Input example #1
1 100
Output example #1
1
Input example #2
5 1000
Output example #2
120
Author PAWLO1993