{"raw_statement":[{"iden":"problem statement","content":"You are given a prime number $p$ and non-negative integers $a$ and $b$.\nDetermine if there is an infinite sequence of non-negative integers $t = \\bigl(t(0), t(1), t(2), \\ldots)$ that satisfies all of the following conditions.\n\n*   $0\\leq t(x) < p$ for every non-negative integer $x$.\n*   $t(x+y)\\bigl(1-t(x)t(y)\\bigr)\\equiv t(x)+t(y)\\pmod{p}$ for all non-negative integers $x$ and $y$.\n*   $t(a)=b$.\n\nYou have $T$ test cases to solve."},{"iden":"constraints","content":"*   $1\\leq T\\leq 2\\times 10^5$\n*   $p$ is a prime number such that $1\\leq p\\leq 10^9$.\n*   $0\\leq a\\leq 10^{9}$\n*   $0\\leq b < p$"},{"iden":"input","content":"The input is given from Standard Input in the following format:\n\n$T$\n$\\text{case}_1$\n$\\vdots$\n$\\text{case}_T$\n\nEach test case is given in the following format:\n\n$p$ $a$ $b$"},{"iden":"sample input 1","content":"4\n11 1 0\n11 1 1\n11 1 3\n11 1 5"},{"iden":"sample output 1","content":"Yes\nNo\nNo\nYes\n\n*   For $p=11, a=1, b=0$, a constant sequence $t = (0,0,0,0,\\ldots)$ satisfies the conditions.\n*   For $p=11, a=1, b=5$, a sequence $t = (0,5,6,0,5,6,\\ldots)$ of period $3$ satisfies the conditions."},{"iden":"sample input 2","content":"5\n5 0 0\n5 1 1\n5 2 2\n5 3 3\n5 4 4"},{"iden":"sample output 2","content":"Yes\nNo\nYes\nYes\nNo"},{"iden":"sample input 3","content":"7\n2 3 1\n2 5 0\n5 0 1\n5 0 2\n7 1 4\n11 12345 5\n13 12345 5"},{"iden":"sample output 3","content":"Yes\nYes\nNo\nYes\nNo\nNo\nYes"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}