{"trustable":false,"prependHtml":"\u003cscript\u003e window.katexOptions \u003d { disable: true }; \u003c/script\u003e\n\u003cscript type\u003d\"text/x-mathjax-config\"\u003e\n MathJax.Hub.Config({\n tex2jax: {\n inlineMath: [[\u0027$$$\u0027,\u0027$$$\u0027], [\u0027$\u0027,\u0027$\u0027]],\n displayMath: [[\u0027$$$$$$\u0027,\u0027$$$$$$\u0027], [\u0027$$\u0027,\u0027$$\u0027]]\n }\n });\n\u003c/script\u003e\n\u003cscript async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS-MML_HTMLorMML\" type\u003d\"text/javascript\"\u003e\u003c/script\u003e","sections":[{"title":"","value":{"format":"HTML","content":"\u003cscript type\u003d\u0027text/x-mathjax-config\u0027\u003eMathJax.Hub.Config({tex2jax: { inlineMath: [[\u0027$\u0027,\u0027$\u0027]] } }); \u003c/script\u003e\n\u003cscript type\u003d\u0027text/javascript\u0027 src\u003d\u0027https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.1/MathJax.js?config\u003dTeX-AMS-MML_HTMLorMML\u0027\u003e\u003c/script\u003e\n\u003cscript type\u003d\u0027text/javascript\u0027\u003esetTimeout(function(){MathJax.Hub.Queue([\u0027Typeset\u0027, MathJax.Hub, \u0027left_view\u0027]);}, 2000);\u003c/script\u003e\n\u003cdiv class\u003d\"panel_content\"\u003e\n As one of the most powerful brushes, zhx is required to give his juniors $n$ problems. \n \u003cbr\u003ezhx thinks the $i^{th}$ problem\u0027s difficulty is $i$. He wants to arrange these problems in a beautiful way. \n \u003cbr\u003ezhx defines a sequence $\\{a_{i}\\}$ beautiful if there is an $i$ that matches two rules below: \n \u003cbr\u003e1: $a_{1} .. a_{i}$ are monotone decreasing or monotone increasing. \n \u003cbr\u003e2: $a_{i} .. a_{n}$ are monotone decreasing or monotone increasing. \n \u003cbr\u003eHe wants you to tell him that how many permutations of problems are there if the sequence of the problems\u0027 difficulty is beautiful. \n \u003cbr\u003ezhx knows that the answer may be very huge, and you only need to tell him the answer module $p$. \n\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"Multiply test cases(less than $1000$). Seek $EOF$ as the end of the file. \n\u003cbr\u003eFor each case, there are two integers $n$ and $p$ separated by a space in a line. ($1 \\leq n,p \\leq 10^{18}$)"}},{"title":"Output","value":{"format":"HTML","content":"For each test case, output a single line indicating the answer. \n\u003cbr\u003e"}},{"title":"Sample Input","value":{"format":"HTML","content":"\u003cpre\u003e2 233\n3 5\u003c/pre\u003e"}},{"title":"Sample Output","value":{"format":"HTML","content":"\u003cpre\u003e2\n1\n\n\n \n \u003ci style\u003d\"font-size:1px\"\u003e \u003c/i\u003e\u003c/pre\u003e"}},{"title":"Hint","value":{"format":"HTML","content":"\u003cpre\u003eIn the first case, both sequence {1, 2} and {2, 1} are legal.\nIn 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 \u003d 1\n \n \u003c/pre\u003e"}},{"title":"ps:","value":{"format":"HTML","content":"这题要用到快速乘法,不然会爆"}}]}