#include <iostream>
using namespace std;
typedef long long ll;

const int B = 200000;

ll mod_pow(ll x, ll e, ll MOD){
    ll v = 1;
    for(;e;e>>=1){
        if(e & 1){
            v = (v * x) % MOD;
        }
        x = (x * x) % MOD;
    }
    return v;
}

bool is_prime(ll n){
    for(ll d=2;d*d<=n;d++)if(n % d == 0)return false;
    return true;
}

ll solve(ll N, ll M){
    if(M == 1)return 0;
    if(N >= M)return 0;
    
    if(is_prime(M)){
        ll sp = 1;
        for(ll k=N+1;k<M;k++)sp = (sp * k) % M;
        
        ll res = mod_pow(sp, M - 2, M);
        res = (M - res) % M;
        
        return res;
    } else {
        if(M <= B){
            ll res = 1;
            for(ll i=1;i<=N;i++)res = (res * i) % M;
            return res;
        } else {
            return 0;
        }
    }
}

int main(){
    int T;
    cin >> T;
    
    for(int i=0;i<T;i++){
        ll N, M;
        cin >> N >> M;
        
        cout << solve(N, M) << endl;
    }
    return 0;
}