Problems

# Nicholas Problem

# Nicholas Problem

Nicholas must deliver gifts to **n** (**n** ≤ `10`

) 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 ^{18}**m** (**m** ≤ **2009**).

#### Input

Two positive integers **n** and **m**.

#### Output

Print the number of possible ways deliver presents.

Input example #1

1 100

Output example #1

1

Input example #2

5 1000

Output example #2

120