#include <bits/stdc++.h>
using namespace std;
using int64 = long long;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int T;
    int mod;
    cin >> T >> mod;
    vector<int> Ns(T);
    int Nmax = 0;
    for(int i = 0; i < T; i++){
        cin >> Ns[i];
        Nmax = max(Nmax, Ns[i]);
    }

    // 前処理
    vector<int> fac(Nmax+1), Inv(Nmax+1);
    fac[0] = 1;
    for(int i = 1; i <= Nmax; i++){
        fac[i] = (int64)fac[i-1] * i % mod;
    }
    Inv[0] = Inv[1] = 1;
    for(int i = 2; i <= Nmax; i++){
        Inv[i] = (Inv[i-1] + (int64)(i-1) * Inv[i-2]) % mod;
    }

    int H = Nmax / 2;
    vector<int> pw2(H+1), Sym(H+1);
    pw2[0] = 1;
    for(int i = 1; i <= H; i++){
        pw2[i] = (pw2[i-1] * 2LL) % mod;
    }
    Sym[0] = 1;
    if(H >= 1) Sym[1] = 2 % mod;
    for(int i = 2; i <= H; i++){
        Sym[i] = (
            2LL * Sym[i-1]
            + 2LL * (i-1) % mod * Sym[i-2]
        ) % mod;
    }

    // 各クエリ処理
    for(int n : Ns){
        if(n == 1){
            cout << 1 << "\n";
            continue;
        }
        int64 F = fac[n];
        int64 D = Inv[n];
        int m = n >> 1;
        int64 C = (int64)fac[m] * pw2[m] % mod;
        int64 A = Sym[m];
        int64 B = ((n%4==0 || n%4==1) ? 2 : 0);

        int64 ans = (
              8LL * F
            - 8LL * D
            - 4LL * C
            + 6LL * A
            - 2LL * B
        ) % mod;
        if(ans < 0) ans += mod;
        cout << ans << "\n";
    }

    return 0;
}