#include <bits/stdc++.h>
#define rep(i, a) for (int i = 0; i < (a); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); i++)
#define repr(i, a) for (int i = (a) - 1; i >= 0; i--)
#define repr2(i, a, b) for (int i = (b) - 1; i >= (a); i--)
using namespace std;
typedef long long ll;

ll modpow(ll a, ll b, ll mod) {
	if (b == 0) return 1;
	return modpow(a * a % mod, b / 2, mod) * (b & 1 ? a : 1) % mod;
}

ll modinv(ll a, ll mod) {
	return modpow(a, mod - 2, mod);
}

bool isprime(ll n) {
	for (ll i = 2; i * i <= n; i++) {
		if (n % i == 0) return false;
	}
	return n != 1;
}

int main() {
	int T;
	cin >> T;
	while (T--) {
		ll N, M;
		cin >> N >> M;
		if (N >= M) {
			cout << 0 << endl;
		} else if (isprime(M)) {
			ll fact = M - 1;
			ll prod = 1;
			for (ll i = N + 1; i < M; i++) {
				prod *= i;
				prod %= M;
			}
			fact *= modinv(prod, M);
			fact %= M;
			cout << fact << endl;
		} else {
			if (M <= 1000000) {
				ll fact = 1 % M;
				rep (i, N) {
					fact *= i + 1;
					fact %= M;
				}
				cout << fact << endl;
			} else {
				cout << 0 << endl;
			}
		}
	}
	return 0;
}