def inv(val,div,M):
    # return S,T s.t. S*div +T*M = val
    if div > M:
        s,t=inv(val,M,div)
        return (t,s)
    if div==1:
        return (val,0)
    # S*div+T*(p*div+r)=val, (S+T*p)div+T*r=val
    (T,STp)=inv(val,M%div,div)
    return ((STp-T*(M/div)),T)

T=int(raw_input())
isPrime=[True for i in range(100000)]
isPrime[0]=False
isPrime[1]=False
for i in range(100000):
    if isPrime[i]:
        for j in range(i+i,100000,i):
            isPrime[j]=False
primes=[i for i in range(100000) if isPrime[i]]

for i in range(T):
    N,M=map(int,raw_input().split())
    if N>=M:
        print 0
        continue
    if M<=2*100000:
        ans=1
        for i in range(1,N+1):
            ans*=i
            ans%=M
        print ans%M
        continue
    isMprime=True
    for p in primes:
        if M%p==0:
            isMprime=False
            break
    if isMprime==False:
        print 0
        continue
    cur=M-1
    for p in range(M-1, N,-1):
        s,t=inv(cur,p,M)
        #print cur,"=",s,"*",p,"+",t,"*",M
        cur=s%M
    print cur%M