#include <bits/stdc++.h>

#define rep(i, j, k) for (int i = (j); i <= (k); ++i)
#define per(i, j, k) for (int i = (j); i >= (k); --i)
#define SZ(v) int((v).size())
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second
using ll = long long;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;

template<class T>inline void chkmn(T &x, T y) { if (y < x) x = y; }
template<class T>inline void chkmx(T &x, T y) { if (y > x) x = y; }

using namespace std;

int P;
class mod_int {
  using Z = mod_int;

private:
  static int mo(int x) { return x < 0 ? x + P : x; }

public:
  int x;
  int val() const { return x; }
  mod_int() : x(0) {}
  template <class T>
  mod_int(const T &x_) : x(x_ >= 0 && x_ < P ? static_cast<int>(x_) : mo(static_cast<int>(x_ % P))) {}
  bool operator==(const Z &rhs) const { return x == rhs.x; }
  bool operator!=(const Z &rhs) const { return x != rhs.x; }
  Z operator-() const { return Z(x ? P - x : 0); }
  Z pow(long long k) const {
    Z res = 1, t = *this;
    while (k) {
      if (k & 1) res *= t;
      if (k >>= 1) t *= t;
    }
    return res;
  }
  Z &operator++() {
    x < P - 1 ? ++x : x = 0;
    return *this;
  }
  Z &operator--() {
    x ? --x : x = P - 1;
    return *this;
  }
  Z operator++(int) {
    Z ret = x;
    x < P - 1 ? ++x : x = 0;
    return ret;
  }
  Z operator--(int) {
    Z ret = x;
    x ? --x : x = P - 1;
    return ret;
  }
  Z inv() const { return pow(P - 2); }
  Z &operator+=(const Z &rhs) {
    (x += rhs.x) >= P && (x -= P);
    return *this;
  }
  Z &operator-=(const Z &rhs) {
    (x -= rhs.x) < 0 && (x += P);
    return *this;
  }
  Z &operator*=(const Z &rhs) {
    x = 1ULL * x * rhs.x % P;
    return *this;
  }
  Z &operator/=(const Z &rhs) { return *this *= rhs.inv(); }
#define setO(T, o)                                 \
  friend T operator o(const Z &lhs, const Z &rhs) {\
    Z res = lhs;                                   \
    return res o## = rhs;                          \
  }
  setO(Z, +) setO(Z, -) setO(Z, *) setO(Z, /)
#undef setO
};
using Z = mod_int;

const int maxn = 1010;
const int maxv = 1000;

int n, m;
Z prod[maxn], c[maxn][maxn], f[maxn][maxn], way[maxn];

void work() {
  cin >> n >> m;
  prod[0] = 1;
  rep (i, 1, n) prod[i] = prod[i - 1] * (m - i + 1);
  rep (k, 1, n) {
    // 众数个数 <= k 的方案数
    // f[i][j] 填了 i 个，j 种数
    int lim = n / (k + 1);
    rep (i, 0, n) rep (j, 0, lim) f[i][j] = 0;
    rep (i, 0, lim) f[0][i] = 1;
    rep (i, 1, n) rep (j, 0, lim) {
      f[i][j] = f[i - 1][j] * (m - j);
      if (i >= k + 1) f[i][j] -= f[i - k - 1][j + 1] * (m - j) * c[i - 1][k];
    }
    way[k] = f[n][0];
  }
  Z ans = 0;
  rep (i, 1, n) ans += way[n] - way[i - 1];
  cout << ans.val() << '\n';
}

int main() {
  cin.tie(nullptr) -> ios::sync_with_stdio(false);
  int t; cin >> t >> P;
  c[0][0] = 1;
  rep (i, 1, maxv) {
    c[i][0] = 1;
    rep (j, 1, i) c[i][j] = c[i - 1][j] + c[i - 1][j - 1];
  }
  while (t--) work();
}