Nicholas must deliver gifts to n (n ≤ 1018) 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 (m ≤ 2009).

Input

Two positive integers n and m.

Output

Print the number of possible ways deliver presents.