#include<bits/stdc++.h>
using namespace std;

vector<pair<int,int>> prime_fact(int n)
{
  vector<pair<int,int>> res;
  for(int i=2;i*i<=n;++i)
  {
    if(n%i!=0)
    {
      continue;
    }
    int exp=0;
    while(n%i==0)
    {
      n/=i;
      exp+=1;
    }
    res.push_back({i,exp});
  }
  if(n!=1)
  {
    res.push_back({n,1});
  }
  return res;
}

bool is_prime(int n)
{
  if(n<2)
  {
    return false;
  }
  for(int i=2;i*i<=n;++i)
  {
    if(n%i==0)
    {
      return false;
    }
  }
  return true;
}

int64_t pow_mod(int64_t a,int64_t n,int64_t mod)
{
  int64_t res=1,now=a;
  while(n)
  {
    if(n&1)
    {
      res=res*now%mod;
    }
    now=now*now%mod;
    n>>=1;
  }
  return res;
}

int64_t inv_mod(int64_t a,int64_t mod)
{
  return pow_mod(a,mod-2,mod);
}

void solve1(int64_t N,int64_t M)
{
  if(M<=N)
  {
    cout<<0<<endl;
    return;
  }
  int64_t ans=1;
  for(int64_t i=1;i<=N;++i)
  {
    ans=ans*i%M;
  }
  cout<<ans<<endl;
  return;
}

void solve2(int64_t N,int64_t M)
{
  if(!is_prime(M))
  {
    cout<<0<<endl;
    return;
  }
  if(M<=N)
  {
    cout<<0<<endl;
    return;
  }
  int64_t prod=1;
  for(int64_t i=N+1;i<M;++i)
  {
    prod=prod*i%M;
  }
  cout<<M-inv_mod(prod,M)<<endl;
  return;
}

void solve()
{
  int64_t N,M;
  cin>>N>>M;
  if(M<=200000)
  {
    solve1(N,M);
  }
  else
  {
    solve2(N,M);
  }
  return;
}

int main()
{
  int T;
  cin>>T;
  for(int i=0;i<T;++i)
  {
    solve();
  }
  return 0;
}