#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;
int n,m,p,f[N];
ll dp[N][N],C[N][N];
void Solve(){
	scanf("%d%d",&n,&m);
	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;
	for(int i=0;i<=n;i++) Me(dp[i],0);
	dp[0][0]=1;
	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=__gcd(x,f[j]);
			f[j]/=g;x/=g;
		}
		dp[i][0]=1;
		for(int j=1;j<=i;j++) dp[i][0]=dp[i][0]*f[j]%p;
	}
	ll ans=1;for(int i=1;i<=n;i++) ans=ans*m%p;
	ans=ans*n%p;
	for(int i=1;i<n;i++){
		for(int x=0;x*i<=n;x++){
			for(int y=0;y+x*i<=n;y++){
				ll w=dp[x][y];
				for(int z=1;z<=x&&y+z*i<=n;z++){
					w=w*C[y+z*i][y+(z-1)*i]%p;
					dp[x-z][y+z*i]=(dp[x-z][y+z*i]+w*C[x][z])%p;
				}
			}
		}
		ans-=dp[0][n];
	}
	printf("%lld\n",(ans%p+p)%p);
}
int main(){
	int t=1;
	scanf("%d%d",&t,&p);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}