#include <bits/stdc++.h>
#define pb emplace_back
#define fst first
#define scd second
#define mkp make_pair
#define mems(a, x) memset((a), (x), sizeof(a))

using namespace std;
typedef long long ll;
typedef double db;
typedef unsigned long long ull;
typedef long double ldb;
typedef pair<ll, ll> pii;

const int maxn = 1010;

ll n, m, mod, f[maxn][maxn], C[maxn][maxn], g[maxn];

void solve() {
	scanf("%lld%lld", &n, &m);
	for (int i = 0; i <= n; ++i) {
		C[i][0] = C[i][i] = 1;
		for (int j = 1; j < i; ++j) {
			C[i][j] = (C[i - 1][j - 1] + C[i - 1][j]) % mod;
		}
	}
	for (int k = 1; k <= n; ++k) {
		int lim = min(m, (n + k - 1) / k);
		for (int i = 0; i <= n; ++i) {
			for (int j = 0; j <= lim + 1; ++j) {
				f[i][j] = 0;
			}
		}
		for (int i = 0; i <= lim; ++i) {
			f[0][i] = 1;
		}
		for (int i = 1; i <= n; ++i) {
			for (int j = 0; j <= lim; ++j) {
				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;
				}
			}
		}
		g[k] = f[n][0];
	}
	ll ans = 0;
	for (int i = 1; i <= n; ++i) {
		ans = (ans + (g[i] - g[i - 1] + mod) * i) % mod;
	}
	printf("%lld\n", ans);
}

int main() {
	int T = 1;
	scanf("%d%lld", &T, &mod);
	while (T--) {
		solve();
	}
	return 0;
}