#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
#define rep(i, n) REP(i, 0, n)
#define REP(i, s, e) for (ll i = (s); i < (ll)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for (ll i = (ll)(s - 1); i >= (ll)(e); i--)
#define all(r) r.begin(), r.end()
#define rall(r) r.rbegin(), r.rend()

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;

template <typename T, typename U>
bool chmax(T& a, const U& b) {
    if (a >= b) return false;
    a = b;
    return true;
}
template <typename T, typename U>
bool chmin(T& a, const U& b) {
    if (a <= b) return false;
    a = b;
    return true;
}

void yes_no(bool f, string yes = "Yes", string no = "No") {
    cout << (f ? yes : no) << "\n";
}

ll pow_fast(ll x, ll n, ll mod) {
    ll ret = 1;
    while (n) {
        if (n & 1) (ret *= x) %= mod;
        (x *= x) %= mod;
        n >>= 1;
    }
    return ret;
}

void solve() {
    ll n, m;
    cin >> n >> m;
    if (n >= m || m == 1) {
        cout << 0 << '\n';
        return;
    }
    if (n <= 3e6) {
        ll ans = 1;
        REP(i, 1, n + 1)(ans *= i) %= m;
        cout << ans << "\n";
        return;
    }
    ll f = m + 1;
    for (ll i = 2; i * i <= m; ++i)
        if (m % i == 0) {
            f = i;
            break;
        }
    if (m % f != 0) {
        ll x = 1;
        REP(i, n + 1, m)(x *= i) %= m;
        ll ans = (m - 1) * pow_fast(x, m - 2, m) % m;
        cout << ans << "\n";
    } else {
        cout << 0 << "\n";
    }
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int t = 1;
    cin >> t;
    rep(ti, t) solve();
    return 0;
}