#include #include using namespace std; using ll = long long; #define rep(i,n) for(ll i=0;i; using vvll = vector; using vvvll = vector; using vvvvll = vector; using vb = vector; using vvb = vector; using vvvb = vector; using vvvvb = vector; bool DEB = 0; bool isbool(ll N){ if(N<=1)return 0; for(ll i=2;i*i<=N;i++){ if(N%i==0)return 0; } return 1; } ll modPow(ll a,ll n,ll mod){ a%=mod; if(n==0)return 1; if(n%2==1)return (modPow(a,n-1,mod)*a)%mod; ll res=modPow(a,n/2,mod); return (res*res)%mod; } void solve(){ ll N,M; cin>>N>>M; if(N>=M){ cout<<0<N;n--){ pm*=n; pm%=M; } pm=modPow(pm,M-2,M);res*=pm; res%=M; cout<>T; while(T--)solve(); }