#!/usr/bin/ python3.8
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
import numpy as np

T = int(readline())


def MillerRabinTest(n, maxiter=20):
    import random
    if n == 1:
        return False
    elif n == 2:
        return True
    if not n & 1:
        return False
    d = n - 1
    while not (d & 1):
        d >>= 1

    for _ in range(maxiter):
        a = random.randint(1, n - 1)
        t = d
        x = pow(a, t, n)
        while (t != n - 1) and (x != 1) and (x != n - 1):
            x = x * x % n
            t <<= 1
        if (x != n - 1) and not (t & 1):
            return False
    return True


def cumprod(A, MOD):
    L = len(A)
    Lsq = int(L**.5 + 1)
    A = np.resize(A, Lsq**2).reshape(Lsq, Lsq)
    for n in range(1, Lsq):
        A[:, n] *= A[:, n - 1]
        A[:, n] %= MOD
    for n in range(1, Lsq):
        A[n] *= A[n - 1, -1]
        A[n] %= MOD
    return A.ravel()[:L]


def solve():
    N, M = map(int, readline().split())
    if N == 0:
        return 1
    if M <= 2 * 10 ** 5 + 10:
        if N >= M:
            return 0
        else:
            x = np.arange(1, N + 1, dtype=np.int64)
            return cumprod(x, M)[-1]
    if not MillerRabinTest(M):
        return 0
    # P is prime
    P = M
    if N >= P:
        return 0
    if N == P - 1:
        return P - 1
    x = np.arange(1, P - N, dtype=np.int64)
    return P - cumprod(x)[-1]


for _ in range(T):
    print(solve())