#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
#define all(x) x.begin(),x.end()
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=1000+5,M=(1<<20)+5,K=1e7+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const ll INF=1e18+7;mt19937 rnd(263082);
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
    Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
    Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
    #ifdef LOCAL
    #define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
    #else 
    #define gdb(...) void()
    #endif
}using namespace Debug;


typedef unsigned long long ull;
typedef __uint128_t L;
struct FastMod {
    ull b, m;
    FastMod(ull b) : b(b), m(ull((L(1) << 64) / b)) {}
    ull reduce(ull a) {
        ull q = (ull)((L(m) * a) >> 64);
        ull r = a - q * b; // can be proven that 0 <= r < 2*b
        return r >= b ? r - b : r;
    }
};
FastMod F(2);


int n,m,p,f[N],G[N][N];
ull C[N][N];
ull dp[N][N];
void init(){
    F = FastMod(p);
    const int n=1000;
    for(int i=0;i<=n;i++) for(int j=C[i][0]=1;j<=i;j++) C[i][j]=(C[i-1][j]+C[i-1][j-1])%p;
    dp[0][0]=1;
    for(int i=n;i;i--){
        for(int x=n/i;~x;x--){
            for(int y=x*i;y<=n;y++)if(dp[x][y]){
                ull w=(x?dp[x][y]:F.reduce(dp[x][y]*i));
                for(int z=1;i*(x+z)<=n&&y+z*i<=n;z++){
                    w=F.reduce(w*C[y+z*i][y+(z-1)*i]);
                    dp[x+z][y+z*i]=F.reduce(dp[x+z][y+z*i]+w*C[x+z][x]);
                }
            }
        }
    }
    for(int i=1;i<=n;i++) G[i][0]=G[0][i]=i;
    for(int i=1;i<=n;i++)
    	for(int j=1;j<=i;j++)
    		G[i][j]=G[j][i]=G[i-j][j];
}
void Solve(){
    scanf("%d%d",&n,&m);
    ull ans=0;
    for(int i=1;i<=n&&i<=m;i++){
        f[i]=m-i+1;
        int x=i;
        for(int j=1;j<=i;j++){
            int g=G[x][f[j]%x];
            f[j]/=g;x/=g;
        }
        ull mul=1;
        for(int j=1;j<=i;j++) mul=F.reduce(mul*f[j]);
        ans+=mul*dp[i][n]%p;
    }
    printf("%lld\n",(ans%p+p)%p);
}
void GT()
{
//	printf("clock=%d\n",(int)clock());
}
int main(){
//    freopen("1.in","r",stdin);freopen("1.out","w",stdout);
    int t=1;
    scanf("%d%d",&t,&p);
    GT();
    init();
    GT();
    while(t--) Solve();
    GT();
}