In the equation X^2≡X(mod N) where x∈[0,N-1], we define He[N] as the number of solutions. And furthermore, define HeHe[N]=He[1]*……*He[N] Now here is the problem, write a program, output HeHe[N] modulo M for a given pair N, M.
输入解释
First line: an integer t, representing t test cases. Each test case contains two numbers N (1<=N<=10^7) and M (0<M<=10^9) separated by a space.
输出解释
For each test case, output one line, including one integer: HeHe[N] mod m.