#include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
#define rep(i, n) for(int i=0;i<n;i++)
#define all(i, v) for(auto& i : v)
typedef long long ll;
using namespace std;
const ll mod=1000000007, INF=(1LL<<60);
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;


map<ll, ll> prime(ll n) {
    ll m = n;
    map<ll, ll> mp;
    for(ll i=2;i*i<=n;i++) {
        while(m % i == 0) {
            m /= i;
            mp[i]++;
        }
    }
    if(m > 1) mp[m]++;
    return mp;
}


long long modinv(long long a, long long m) {
    long long b = m, u = 1, v = 0;
    while (b) {
        long long t = a / b;
        a -= t * b; swap(a, b);
        u -= t * v; swap(u, v);
    }
    u %= m; 
    if (u < 0) u += m;
    return u;
}

void solve() {
    ll n, m;
    cin >> n >> m;
    if(n >= m || m == 1) {
        cout << 0 << endl;
        return;
    }
    if(n == 0) {
        cout << 1 << endl;
        return;
    }
    int cnt = 0;
    map<ll, ll> mp = prime(m);
    {
        bool ok = true;
        
        for(auto [x, y] : mp) {
            cnt += y;
            ll e = n;
            rep(i, y) {
                if(e < x) ok = false;
                e /= x;
            }
        }
        if(ok) {
            cout << 0 << endl;
            return;
        }
    } 
    ll ans = 1;
    if(cnt == 1) {
        ans = -1;
        for(ll i=n+1;i<m;i++) {
            ans *= modinv(i, m);
            ans %= m;
        }
        ans += m;
        ans %= m;
        cout << ans << endl;
        return;
    }
    for(ll i=2;i<=n;i++) {
        ans *= i;
        ans %= m;
    }
    cout << ans << endl;
}

int main() {
    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(false);
    ll t;
    cin >> t;
    while(t--) solve();
    return 0;
}