#include <bits/stdc++.h>
using namespace std;
const int N = 405;
int T, p, fac[N], g[N], f[N][N], ans[N];
inline int read() {
  char c = getchar();
  int ans = 0;
  while (c < 48 || c > 57) c = getchar();
  while (c >= 48 && c <= 57)
    ans = (ans << 3) + (ans << 1) + (c ^ 48), c = getchar();
  return ans;
}
inline void write(int x) {
  int num = 0;
  char sc[15];
  if (!x) sc[num = 1] = 48;
  while (x) sc[++num] = x % 10 + 48, x /= 10;
  while (num) putchar(sc[num--]);
  putchar('\n');
}
int main() {
  T = read(), p = read();
  fac[0] = fac[1] = g[1] = f[1][1] = ans[1] = 1;
  for (register int i = 2; i <= 400; ++i) {
    g[i] = f[i][1] = ans[i] = fac[i] = 1ll * fac[i - 1] * i % p;
    for (register int j = 1; j < i; ++j)
      g[i] = (g[i] - 1ll * g[j] * fac[i - j] % p + p) % p,
      ans[i] = (ans[i] - 2ll * g[j] * fac[i - j] % p + p) % p;
    for (register int j = 2; j <= i; ++j)
      for (register int k = j - 1; k < i; ++k)
        f[i][j] = (f[i][j] + 1ll * f[k][j - 1] * fac[i - k]) % p;
    for (register int j = 3; j < i; ++j)
      ans[i] = (ans[i] - 1ll * f[i][j] * ans[j] % p + p) % p;
  }
  ans[2] = 2;
  while (T--) write(ans[read()]);
  return 0;
}
