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

bool isprime(long long x) {
    for (long long i = 2; i * i <= x; i++) {
        if (x % i == 0) {
            return false;
        }
    }
    return true;
}

int main() {
    int T;
    cin >> T;
    while (T--) {
        long long N, M;
        cin >> N >> M;

        if (N < 1e5) {
            long long ans = 1;
            for (int i = 2; i <= N; i++) {
                (ans *= i) %= M;
            }
            cout << ans << endl;
            continue;
        }

        if (N >= M || M == 1) {
            cout << 0 << endl;
            continue;
        }

        if (!isprime(M)) {
            cout << 0 << endl;
            continue;
        }

        auto modpow = [&](long long a, long long n) {
            long long t = 1;
            while (n) {
                if (n & 1)
                    (t *= a) %= M;
                (a *= a) %= M;
            }
            return t;
        };
        auto inv = [&](long long a) {
            return modpow(a, M - 2);
        };

        long long ans = M - 1;
        for (long long i = M - 2; i > N; i--)
            (ans *= inv(i)) %= M;
        cout << ans << endl;
    }
}