#include<iostream>
using namespace std;


int n, m;

void read() {
    cin >> n >> m;
}


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


int modpow(int p, int nMul, int mod) {
    int ret = 1;
    while (nMul) {
        if (nMul & 1) ret = 1LL * ret * p % mod;
        ret = 1LL * ret * ret % mod;
        nMul >>= 1;
    }
    return ret;
}


// mod: 素数
int inv(int num, int mod) {
    return modpow(num, mod - 2, mod);
}


void work() {
    if (n >= m) {
        cout << 0 << endl;
        return;
    }

    if (isPrime(m)) {
        int toInv = 1;
        for (int i = m - 1; i > n; --i)
            toInv = 1LL * toInv * i % m;
        cout << 1LL * (m - 1) * inv(toInv, m) % m << endl;
    }
    else {
        int ans = 1;
        for (int i = 1; i <= n; ++i) {
            ans = 1LL * ans * i % m;
            if (ans == 0)
                break;
        }
        cout << ans << endl;
    }
}


int main() {
    int cases;
    cin >> cases;
    for (int i = 0; i < cases; ++i) {
        read();
        work();
    }
    return 0;
}