{"trustable":true,"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":"\u003cdiv class\u003d\"panel_content\"\u003eAs we know, Rikka is poor at math. Yuta is worrying about this situation, so he gives Rikka some math tasks to practice. There is one of them:\u003cbr\u003e\u003cbr\u003eAlice and Bob are going to play a famous game: Rock-paper-scissors. Both of them don’t like to think a lot, so both of them will use the random strategy: choose rock/paper/scissors in equal probability. \u003cbr\u003e\u003cbr\u003eThey want to play this game $n$ times, then they will calculate the score $s$ in the following way: if Alice wins $a$ times, Bob wins $b$ times, and in the remaining $n-a-b$ games they make a tie, the score will be the greatest common divisor of $a$ and $b$.\u003cbr\u003e\u003cbr\u003eKnow Yuta wants to know the expected value of $s \\times 3^{2n}$. It is easy to find that the answer must be an integer.\u003cbr\u003e\u003cbr\u003eIt is too difficult for Rikka. Can you help her?\u003cbr\u003e\u003cbr\u003eNote: If one of $a,b$ is $0$, we define the greatest common divisor of $a$ and $b$ as $a+b$.\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"The first line contains a number $t(1 \\leq t \\leq 20)$, the number of the testcases. There are no more than $2$ testcases with $n \\geq 10^4$.\u003cbr\u003e\u003cbr\u003eFor each testcase, the first line contains two numbers $n,mo(1 \\leq n \\leq 10^5, 10^8 \\leq mo \\leq 10^9)$\u003cbr\u003e\u003cbr\u003eIt is guaranteed that $mo$ is a prime number. "}},{"title":"Output","value":{"format":"HTML","content":"For each testcase, print a single line with a single number -- the answer modulo $mo$."}},{"title":"Sample","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e5\r\n1 998244353\r\n2 998244353\r\n3 998244353\r\n4 998244353\r\n5 998244353\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e6\r\n90\r\n972\r\n9720\r\n89910\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}