#include <bits/stdc++.h>
using namespace std;

//入力が必ず-mod<a<modの時.
template<const int mod>
struct modint{ //mod変更が不可能.
    public:
    long long v = 0;
    static void setmod(int m){} //飾り.
    static constexpr long long getmod(){return mod;}
    modint(){v = 0;} modint(int a){v = a<0?a+mod:a;} modint(long long a){v = a<0?a+mod:a;}
    modint(unsigned int a){v = a;} modint(unsigned long long a){v = a;}
    long long val()const{return v;}
 
    modint &operator=(const modint &b) = default;
    modint operator+()const{return (*this);}
    modint operator-()const{return modint(0)-(*this);}
    modint operator+(const modint b)const{return modint(v)+=b;}
    modint operator-(const modint b)const{return modint(v)-=b;}
    modint operator*(const modint b)const{return modint(v)*=b;}
    modint operator/(const modint b)const{return modint(v)/=b;}
    modint operator+=(const modint b){
        v += b.v; if(v >= mod) v -= mod;
        return *this;
    }
    modint operator-=(const modint b){
        v -= b.v; if(v < 0) v += mod; 
        return *this;
    }   
    modint operator*=(const modint b){v = v*b.v%mod; return *this;}
    modint operator/=(modint b){ //b!=0 mod素数が必須.
        if(b == 0) assert(false);
        int left = mod-2;
        while(left){if(left&1) *this *= b; b *= b; left >>= 1;}
        return *this;
    }
    modint operator++(){*this += 1; return *this;}
    modint operator--(){*this -= 1; return *this;}
    modint operator++(int){*this += 1; return *this;}
    modint operator--(int){*this -= 1; return *this;}
    bool operator==(const modint b)const{return v == b.v;}
    bool operator!=(const modint b)const{return v != b.v;}
    bool operator>(const modint b)const{return v > b.v;}
    bool operator>=(const modint b)const{return v >= b.v;}
    bool operator<(const modint b)const{return v < b.v;}
    bool operator<=(const modint b)const{return v <= b.v;}
    modint pow(long long n)const{
        modint ret = 1,p = v;
        if(n < 0) p = p.inv(),n = -n;
        while(n){
            if(n&1) ret *= p;
            p *= p; n >>= 1;
        }
        return ret;
    }
    modint inv()const{return modint(1)/v;} //素数mod必須.
};
 
template<int idx> //modが入力で与えられる場合. 
struct dynamic_modint{ //mod変更が可能 最初にsetmod必須 idxで複数個所持が可能.
    private:
    static int mod;
    public:
    long long v = 0;
    static constexpr long long getmod(){return mod;}
    static void setmod(int m){
        assert(m > 0);
        mod = m;
    }
    dynamic_modint(){v = 0;}
    dynamic_modint(int a){v = a<0?a+mod:a;} dynamic_modint(long long a){v = a<0?a+mod:a;}
    dynamic_modint(unsigned int a){v = a;}
    dynamic_modint(unsigned long long a){v = a;}
    long long val()const{return v;}
 
    dynamic_modint &operator=(const dynamic_modint &b) = default;
    dynamic_modint operator+()const{return (*this);}
    dynamic_modint operator-()const{return dynamic_modint(0)-(*this);}
    dynamic_modint operator+(const dynamic_modint b)const{return dynamic_modint(v)+=b;}
    dynamic_modint operator-(const dynamic_modint b)const{return dynamic_modint(v)-=b;}
    dynamic_modint operator*(const dynamic_modint b)const{return dynamic_modint(v)*=b;}
    dynamic_modint operator/(const dynamic_modint b)const{return dynamic_modint(v)/=b;}
    dynamic_modint operator+=(const dynamic_modint b){
        v += b.v; if(v >= mod) v -= mod;
        return *this;
    }
    dynamic_modint operator-=(const dynamic_modint b){
        v -= b.v; if(v < 0) v += mod; 
        return *this;
    }   
    dynamic_modint operator*=(const dynamic_modint b){v = v*b.v%mod; return *this;}
    dynamic_modint operator/=(dynamic_modint b){ //b!=0 mod素数が必須.
        if(b == 0) assert(false);
        int left = mod-2;
        while(left){if(left&1) *this *= b; b *= b; left >>= 1;}
        return *this;
    }
    dynamic_modint operator++(){*this += 1; return *this;}
    dynamic_modint operator--(){*this -= 1; return *this;}
    dynamic_modint operator++(int){*this += 1; return *this;}
    dynamic_modint operator--(int){*this -= 1; return *this;}
    bool operator==(const dynamic_modint b)const{return v == b.v;}
    bool operator!=(const dynamic_modint b)const{return v != b.v;}
    bool operator>(const dynamic_modint b)const{return v > b.v;}
    bool operator>=(const dynamic_modint b)const{return v >= b.v;}
    bool operator<(const dynamic_modint b)const{return v < b.v;}
    bool operator<=(const dynamic_modint b)const{return v <= b.v;}
    dynamic_modint pow(long long n)const{
        dynamic_modint ret = 1,p = v;
        if(n < 0) p = p.inv(),n = -n;
        while(n){
            if(n&1) ret *= p;
            p *= p; n >>= 1;
        }
        return ret;
    }
    dynamic_modint inv()const{return dynamic_modint(1)/v;} //素数mod必須.
};
template<int idx> int dynamic_modint<idx>::mod=998244353;
using mint = dynamic_modint<0>;

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int T; cin >> T;
    while(T--){
        int N,mod; cin >> N >> mod;
        if(N >= mod){cout << "0\n"; continue;}
        mint::setmod(mod);
        if(N < 1000000){
            mint answer = 1%mod;
            for(int i=1; i<=N; i++) answer *= i;
            cout << answer.v << "\n";
        }
        else{
            bool prime = true;
            for(int i=2; i*i<=mod; i++) if(mod%i == 0){prime = false; break;}
            if(!prime){cout << "0\n"; continue;}

            mint answer = -1;
            for(int i=mod-1; i>N; i--) answer /= i;
            cout << answer.v << "\n";
        }  
    }    
}