Fibonacci numbers (1) P21926

The Fibonacci numbers $F_n$ are defined as follows: $$F_n = \left\{ \begin{array}{ll} 0 & \mbox{if $n = 0$} \\ 1 & \mbox{if $n = 1$} \\ F_{n-1} + F_{n-2} & \mbox{if $n \ge 2$} \end{array} \right.$$ Therefore, the first Fibonacci numbers are 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, …

For every given pair of natural numbers $n$ and $m$, compute $F_n \bmod m$.

Input

Input consists of several pairs of $n$ and $m$. Assume $0 \le n \le 1000$ and $2 \le m \le 10^8$.

Output

For every given pair, print $F_n \bmod m$.