#include <iostream>
#include <cstdint>
#include <vector>
using namespace std;
int64_t extgcd(long a, long b, long &x, long &y) {
  for (int64_t u = y = 1, v = x = 0; a; ) {
    int64_t q = b / a;
    swap(x -= q * u, u);
    swap(y -= q * v, v);
    swap(b -= q * a, a);
  }
  return b;
}

int64_t mod_inverse(long a, long mod) {
  int64_t x, y;
  extgcd(a, mod, x, y);
  x %= mod;
  if(x < 0) x+= mod;
  return x;
}

bool is_prime(int64_t N) {
  if(N == 1) return false;
  for(int64_t i = 2; i * i <= N; i++) {
    if(N % i == 0) return false;
  }
  return true;
}
int main() {
  int32_t T;
  cin >> T;
  while(T--) {
    int64_t N, M;
    cin >> N >> M;
    if(N <= 1000000) {
      int64_t r = 1;
      for(int64_t i = 1; i <= N; i++) {
        r = r * i % M;
      }
      cout << r % M << endl;
    } else if(!is_prime(M) || N >= M) {
      // Mが素数じゃない → 0
      cout << 0 << endl;
    }else{
      int64_t r = M - 1; // (M - 1)! = M - 1 % M
      for(int64_t i = M - 1; i > N; i--) {
        r = r * mod_inverse(i, M) % M;
      }
      cout << r << endl;
    }
  }
}