#include <bits/stdc++.h>
using namespace std;
const int MN = 400;
int f[MN + 10][MN + 10], ans[MN + 10], g[MN + 10];
int MOD = 1e9 + 7;
int fac[MN + 10];
void add(int &x, int y) {
  x += y;
  if (x >= MOD) x -= MOD;
}
void sub(int &x, int y) {
  x -= y;
  if (x < 0) x += MOD;
}
void nico() {
  fac[0] = 1;
  for (int i = 1; i <= MN; i++) {
    fac[i] = 1LL * fac[i - 1] * i % MOD;
  }
  f[0][0] = 1;
  for (int i = 0; i < MN; i++) {
    for (int j = i; j < MN; j++) {
      for (int k = 1; j + k <= MN; k++) {
        add(f[i + 1][j + k], 1LL * f[i][j] * fac[k] % MOD);
      }
    }
  }
  g[1] = 1;
  for (int i = 2; i <= MN; i++) {
    g[i] = fac[i];
    for (int j = 1; j < i; j++) {
      sub(g[i], 1LL * g[j] * fac[i - j] % MOD);
    }
  }
  ans[1] = 1;
  ans[2] = 2;
  for (int i = 3; i <= MN; i++) {
    ans[i] = fac[i];
    for (int j = 3; j < i; j++) {
      sub(ans[i], 1LL * f[j][i] * ans[j] % MOD);
    }
    for (int j = 1; j < i; j++) {
      sub(ans[i], 2LL * g[j] * fac[i - j] % MOD);
    }
  }
}
int main() {
  int T;
  scanf("%d%d", &T, &MOD);
  nico();
  while (T--) {
    int N;
    scanf("%d", &N);
    printf("%d\n", ans[N]);
  }
}

### Prompt

Your challenge is to write a Cpp solution to the following problem:

Consider a permutation p_1, p_2, ... p_n of integers from 1 to n. We call a sub-segment p_l, p_{l+1}, ..., p_{r-1}, p_{r} of the permutation an interval if it is a reordering of some set of consecutive integers. For example, the permutation (6,7,1,8,5,3,2,4) has the intervals (6,7), (5,3,2,4), (3,2), and others. 

Each permutation has some trivial intervals — the full permutation itself and every single element. We call a permutation interval-free if it does not have non-trivial intervals. In other words, interval-free permutation does not have intervals of length between 2 and n - 1 inclusive. 

Your task is to count the number of interval-free permutations of length n modulo prime number p. 

Input

In the first line of the input there are two integers t (1 ≤ t ≤ 400) and p (10^8 ≤ p ≤ 10^9) — the number of test cases to solve and the prime modulo. In each of the next t lines there is one integer n (1 ≤ n ≤ 400) — the length of the permutation. 

Output

For each of t test cases print a single integer — the number of interval-free permutations modulo p. 

Examples

Input


4 998244353
1
4
5
9


Output


1
2
6
28146


Input


1 437122297
20


Output


67777575

Note

For n = 1 the only permutation is interval-free. For n = 4 two interval-free permutations are (2,4,1,3) and (3,1,4,2). For n = 5 — (2,4,1,5,3), (2,5,3,1,4), (3,1,5,2,4), (3,5,1,4,2), (4,1,3,5,2), and (4,2,5,1,3). We will not list all 28146 for n = 9, but for example (4,7,9,5,1,8,2,6,3), (2,4,6,1,9,7,3,8,5), (3,6,9,4,1,5,8,2,7), and (8,4,9,1,3,6,2,7,5) are interval-free.

The exact value for n = 20 is 264111424634864638. 

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
const int MN = 400;
int f[MN + 10][MN + 10], ans[MN + 10], g[MN + 10];
int MOD = 1e9 + 7;
int fac[MN + 10];
void add(int &x, int y) {
  x += y;
  if (x >= MOD) x -= MOD;
}
void sub(int &x, int y) {
  x -= y;
  if (x < 0) x += MOD;
}
void nico() {
  fac[0] = 1;
  for (int i = 1; i <= MN; i++) {
    fac[i] = 1LL * fac[i - 1] * i % MOD;
  }
  f[0][0] = 1;
  for (int i = 0; i < MN; i++) {
    for (int j = i; j < MN; j++) {
      for (int k = 1; j + k <= MN; k++) {
        add(f[i + 1][j + k], 1LL * f[i][j] * fac[k] % MOD);
      }
    }
  }
  g[1] = 1;
  for (int i = 2; i <= MN; i++) {
    g[i] = fac[i];
    for (int j = 1; j < i; j++) {
      sub(g[i], 1LL * g[j] * fac[i - j] % MOD);
    }
  }
  ans[1] = 1;
  ans[2] = 2;
  for (int i = 3; i <= MN; i++) {
    ans[i] = fac[i];
    for (int j = 3; j < i; j++) {
      sub(ans[i], 1LL * f[j][i] * ans[j] % MOD);
    }
    for (int j = 1; j < i; j++) {
      sub(ans[i], 2LL * g[j] * fac[i - j] % MOD);
    }
  }
}
int main() {
  int T;
  scanf("%d%d", &T, &MOD);
  nico();
  while (T--) {
    int N;
    scanf("%d", &N);
    printf("%d\n", ans[N]);
  }
}

```