#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
template <class c>
struct rge {
  c b, e;
};
template <class c>
rge<c> range(c i, c j) {
  return rge<c>{i, j};
}
template <class c>
auto dud(c *r) -> decltype(cerr << *r);
template <class c>
char dud(...);
struct muu {
  template <class c>
  muu &operator<<(const c &) {
    return *this;
  }
  muu &operator()() { return *this; }
};
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using pll = pair<ll, ll>;
using vll = vector<ll>;
const int nax = 407;
ll mod;
int t;
ll dob[nax];
ll gir[nax];
ll glo[nax];
ll sil[nax];
ll ple[nax][nax];
void dod(ll &a, ll b) { a = (a + b) % mod; }
void odj(ll &a, ll b) {
  a = (a - b) % mod;
  if (a < 0) a += mod;
}
int main() {
  scanf("%d%lld", &t, &mod);
  sil[0] = 1;
  for (int i = 1; i < nax; i++) sil[i] = (sil[i - 1] * i) % mod;
  dob[1] = 1;
  dob[2] = 2;
  gir[1] = 1;
  gir[2] = 1;
  ple[0][0] = 1;
  glo[1] = 1;
  glo[2] = 2;
  for (int j = 1; j < nax; j++)
    for (int l = 1; l < nax; l++)
      for (int k = 1; k <= l; k++) dod(ple[j][l], ple[j - 1][l - k] * sil[k]);
  for (int i = 3; i < nax; i++) {
    for (int j = 1; j < i; j++) {
      if (j > 2) {
        dod(glo[i], sil[i - j] * (sil[j] + mod - gir[j]));
      } else {
        dod(glo[i], sil[i - j]);
      }
    }
    gir[i] = glo[i];
    dod(dob[i], sil[i]);
    odj(dob[i], 2 * gir[i]);
    for (int j = 3; j < i; j++) odj(dob[i], dob[j] * ple[j][i]);
    dod(glo[i], gir[i] + dob[i]);
  }
  while (t--) {
    int n;
    scanf("%d", &n);
    printf("%lld\n", dob[n]);
  }
  return 0;
}
