bzoj2186: [Sdoi2008]沙拉公主的困惑

#include<cstdio>
#include<cstring>
#include<cctype>
#include<algorithm>
using namespace std;
#define rep(i,s,t) for(register int i=s;i<=t;i++)
#define dwn(i,s,t) for(register int i=s;i>=t;i--)
#define clr(x,c) memset(x,c,sizeof(x))
#define ll long long
int read(){
    int x=0;char c=getchar();
    while(!isdigit(c)) c=getchar();
    while(isdigit(c)) x=x*10+c-‘0‘,c=getchar();
    return x;
}
const int nmax=1e7+5;
int prime[nmax>>3],ans[nmax],fac[nmax],inv[nmax];bool vis[nmax];
int n,m,mod,T;
void init(){
    int cnt=0,tmp;
    rep(i,2,nmax-1){
        if(!vis[i]) prime[++cnt]=i;
        rep(j,1,cnt){
            tmp=prime[j];
            if((ll)i*tmp>=nmax) break;
            vis[i*tmp]=1;
            if(i%tmp==0) break;
        }
    }
     
    fac[1]=1;
    rep(i,2,nmax-1) fac[i]=(ll)fac[i-1]*i%mod;
     
    inv[1]=1;
    rep(i,2,nmax-1) inv[i]=(ll)(mod-mod/i)*inv[mod%i]%mod;
    ans[1]=1;
    rep(i,2,nmax-1){
        if(!vis[i]) ans[i]=(ll)ans[i-1]*(i-1)%mod*inv[i%mod]%mod;
        else ans[i]=ans[i-1];
    }
}
int main(){
    T=read(),mod=read();
    init();
    while(T--){
        int n=read(),m=read();
        printf("%d\n",(ll)fac[n]*ans[m]%mod);
    }
    return 0;
}