zhx's contest

Time Limit: 2000/1000 MS (Java/Others)

Memory Limit: 65536/65536 K (Java/Others)


As one of the most powerful brushes, zhx is required to give his juniors $n$ problems.
zhx thinks the $i^{th}$ problem's difficulty is $i$. He wants to arrange these problems in a beautiful way.
zhx defines a sequence $\{a_{i}\}$ beautiful if there is an $i$ that matches two rules below:
1: $a_{1} .. a_{i}$ are monotone decreasing or monotone increasing.
2: $a_{i} .. a_{n}$ are monotone decreasing or monotone increasing.
He wants you to tell him that how many permutations of problems are there if the sequence of the problems' difficulty is beautiful.
zhx knows that the answer may be very huge, and you only need to tell him the answer module $p$.


Multiply test cases(less than $1000$). Seek $EOF$ as the end of the file.
For each case, there are two integers $n$ and $p$ separated by a space in a line. ($1 \leq n,p \leq 10^{18}$)


For each test case, output a single line indicating the answer.

Sample Input

2 233 3 5

Sample Output

2 1
In the first case, both sequence {1, 2} and {2, 1} are legal. In the second case, sequence {1, 2, 3}, {1, 3, 2}, {2, 1, 3}, {2, 3, 1}, {3, 1, 2}, {3, 2, 1} are legal, so the answer is 6 mod 5 = 1




BestCoder Round #33