#yuki_109

def isPrime(n):
 if n==2 or n==3: return True
 if n%2==0 or n<2: return False
 for i in range(3,int(n**0.5)+1,2):
  if n%i==0:
   return False    
 return True

def egcd(a, b):
 if a==0:
  return (b,0,1)
 else:
  g,y,x=egcd(b % a, a)
  return (g,x-(b/a)*y,y)

def modinv(a,m):
 g,x,y=egcd(a, m)
 if not g==1:
  raise Exception('modular inverse does not exist')
 else:
  return x%m

t=int(raw_input())

for i in range(t):
 n,m=map(int,raw_input().split())
 if n>=m or m<=1:
  print 0
  continue
 if n<=300000:
  a=1
  for j in xrange(1,n+1):
   a=(a*j)%m;
  print a
  continue
 if isPrime(m)==False:
  print 0
  continue
 r=m-1
 for i in xrange(n+1,m):
  r=(r*i)%m
 print modinv(r,m)