#include<bits/stdc++.h>
using namespace std;
namespace gza{
	#define int long long
	#define pb push_back
	#define MT int TTT=R;while(TTT--)
	#define pc putchar
	#define R read()
	#define fo(i,a,b) for(int i=a;i<=b;i++)
	#define rep(i,a,b) for(int i=a;i>=b;i--)
	#define m1(a,b) memset(a,b,sizeof a)
	namespace IO
	{
		inline int read()
		{
		    int x=0;
		    char ch=getchar();
		    bool f=0;
		    while(!isdigit(ch)){if(ch=='-') f=1;ch=getchar();}
		    while(isdigit(ch)) x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
		    if(f) x=-x;
		    return x;    
		}
		template<typename T> inline void write(T x)
		{
		    if(x<0) pc('-'),x=-x;
		    if(x>9) write(x/10);
		    pc(x%10+'0');
		}
	};
	namespace math
	{
		inline int gcd(int a,int b)
		{
			int az=__builtin_ctz(a),bz=__builtin_ctz(b),z=(az>bz)?bz:az,t;
		    b>>=bz;
		    while(a) a>>=az,t=a-b,b=a,az=__builtin_ctz(t<0?-t:t),a=t<0?-t:t;
		    return b<<z;
		}
		inline int qmi(int a,int b,int p)
		{
			int res=1;
			while(b)
			{
				if(b&1) res=res*a%p;
				a=a*a%p;
				b>>=1;
			}
			return res;
		}
		const int MAXN=2e6+10;
		int my_fac[MAXN],my_inv[MAXN];
		void init_binom(int mod)
		{
			my_fac[0]=1;fo(i,1,min(MAXN,mod)-1) my_fac[i]=my_fac[i-1]*i%mod;
			my_inv[min(MAXN,mod)-1]=qmi(my_fac[min(MAXN,mod)-1],mod-2,mod);rep(i,min(MAXN,mod)-2,0) my_inv[i]=my_inv[i+1]*(i+1)%mod;
		}
		int binom(int a,int b,int mod)
		{
			if(a<b) return 0;
			return my_fac[a]*my_inv[b]%mod*my_inv[a-b]%mod;
		}
	};
	using namespace IO;
	using namespace math;
	
	const int N=1010;
	int T,mod,n,m;
	int f[N][N],C[N][N];;
	void solve()
	{
		n=R,m=R;
		int ans=0,res=1;
		fo(i,1,n) res=res*m%mod,ans=res;
		fo(k,1,n)
		{
			int lim=n/k;
			fo(i,0,lim) f[0][i]=1;
			fo(i,0,n) f[i][lim+1]=0;
			fo(i,1,n) fo(j,0,min(lim,m))
			{
				f[i][j]=f[i-1][j]*(m-j)%mod;
				if(i>k) f[i][j]=(f[i][j]-f[i-k-1][j+1]*C[i-1][k]%mod*(m-j)%mod+mod)%mod;
			}
			ans=(ans+res-f[n][0]+mod)%mod;
		}
		write(ans),puts("");
	}
	void main(){
		T=R,mod=R;
		fo(i,0,N-1)
		{
			C[i][0]=1;
			fo(j,1,i) C[i][j]=(C[i-1][j]+C[i-1][j-1])%mod;
		}
		while(T--) solve();
	}
}
signed main(){
	
	gza::main();
}