#include <bits/stdc++.h>
using namespace std;
template <class T>
using vv = vector<vector<T>>;
template <class T>
inline bool MX(T &l, const T &r) {
  return l < r ? l = r, 1 : 0;
}
template <class T>
inline bool MN(T &l, const T &r) {
  return l > r ? l = r, 1 : 0;
}
const long long MOD = 1e9 + 7;
int T;
int N;
long long P;
long long f[414];
long long g[414];
long long h[414];
long long l[414][414];
long long fac[414];
long long inv[414];
long long mypow(long long base, long long exp) {
  if (exp == 0) return 1 % P;
  long long res = mypow(base * base % P, exp / 2);
  if (exp % 2) res = res * base % P;
  return res;
}
long long nCr(long long n, long long r) {
  if (r < 0 || n < r) return 0;
  return fac[n] * inv[r] % P * inv[n - r] % P;
}
int main() {
  scanf("%d%lld", &T, &P);
  fac[0] = inv[0] = 1;
  for (int(i) = 1; (i) < (414); ++(i)) {
    fac[i] = fac[i - 1] * i % P;
    inv[i] = inv[i - 1] * mypow(i, P - 2) % P;
  }
  l[0][0] = 1;
  f[1] = 0;
  h[1] = 1;
  g[1] = 1;
  for (int(n) = 1; (n) < (414); ++(n)) {
    long long sub = 0;
    for (int(k) = 1; (k) < (n + 1); ++(k)) {
      if (k < n) sub = (sub + g[k] * fac[n - k] % P) % P;
      for (int(j) = 1; (j) < (n + 1); ++(j)) {
        l[n][k] += l[n - j][k - 1] * fac[j] % P;
        l[n][k] %= P;
      }
    }
    g[n] = (fac[n] + P - sub) % P;
    f[n] = 2 * sub % P;
    for (int(k) = 3; (k) < (n); ++(k)) {
      f[n] = (f[n] + l[n][k] * h[k] % P) % P;
    }
    h[n] = (fac[n] + P - f[n]) % P;
  }
  for (int(i) = 0; (i) < (T); ++(i)) {
    scanf("%d", &N);
    if (N == 2)
      printf("2\n");
    else
      printf("%lld\n", h[N]);
  }
}
