#include <sstream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <iostream>
#include <utility>
#include <set>
#include <cctype>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cmath>

#define INF 1000000000

using namespace std;
typedef long long ll;

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

// extgcd
ll extgcd(ll a, ll b, ll& x, ll& y) {
    ll d = a;
    if (b != 0) {
        d = extgcd(b, a % b, y, x);
        y -= (a / b) * x;
    } else {
        x = 1; y = 0;
    }
    return d;
}

// mod_inverse
ll mod_inverse(ll a, ll m) {
    ll x, y;
    extgcd(a, m, x, y);
    return (m+x%m) % m;
}

int main(void) {
    int T;
    cin >> T;
    while (T--) {
        int N, M;
        cin >> N >> M;
        if (N >= M) {
            cout << 0 << endl;
            continue;
        }
        if (M <= 2*100000) {
            ll ans = 1;
            for (ll i = 1; i <= N; i++) {
                ans = (ans*i) % M;
            }
            cout << ans % M << endl;
            continue;
        }
        if (!isPrime(M)) {
            cout << 0 << endl;
        } else {
            ll ans = M-1;
            for (ll i = N+1; i <= M-1; i++) {
                ans = (ans * mod_inverse(i, M)) % M;
            }
            cout << ans << endl;
        }
    }
    return 0;
}