#include <bits/stdc++.h>
#define all(x) begin(x),end(x)
#define rall(x) (x).rbegin(),(x).rend()
#define REP(i,b,n) for(int i=(int)(b);i<(int)(n);++i)
#define rep(i,n) REP(i,0,n)
#define repsz(i,v) rep(i,(v).size())
#define aur auto&
#define bit(n) (1LL<<(n))
#define eb emplace_back
#define mt make_tuple
#define fst first
#define snd second
using namespace std;
typedef long long ll;
//#define int long long
template<class C>int size(const C &c){ return c.size(); }
template<class T>bool chmin(T&a,const T&b){if(a<=b)return false;a=b;return true;}
template<class T>bool chmax(T&a,const T&b){if(a>=b)return false;a=b;return true;}

inline ll powMod(ll b, ll e, ll m){//{{{
    ll res = 1;
    for(; e; e >>= 1, b = b * b % m) if(e&1) res = res * b % m;
    return res;
}//}}}
inline bool is_prime(ll n){//{{{
    if(n < 2) return false;
    if(n % 2 == 0) return n == 2;
    for(int p = 3; p * p <= n; p += 2) if(n % p == 0) return false;
    return true;
}//}}}

bool solve(){
    int T;
    cin >> T;
    rep(_, T){
        ll n, m;
        cin >> n >> m;
        if(n >= m or m == 1){ cout << 0 << endl; continue; }
        if(n < 1000 * 1000){
            ll res = 1;
            rep(i, n+1) if(i) (res *= i) %= m;
            cout << res << endl;
            continue;
        }
        if(!is_prime(m)){ cout << 0 << endl; continue; }
        ll res = 1;
        for(int i = n+1; i <= m-1; ++i) (res *= i) %= m;
        res = powMod(res, m-2, m);
        (res *= m-1) %= m;
        if(res < 0) res += m;
        cout << res << endl;
    }
    return true;
}
signed main(){
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << std::fixed << std::setprecision(10);
    solve();
    return 0;
}
// vim:set foldmethod=marker commentstring=//%s: