#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll ILL=2167167167167167167;
const int INF=2100000000;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
bool yneos(bool a,bool upp=false){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> void vec_out(vector<T> &p,int ty=0){
    if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
    else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}
template<class T> T square(T a){return a * a;}


#include <atcoder/modint>
using mint = atcoder::modint;

void solve();
// CITRUS CURIO CITY / FREDERIC
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    rep(i, 0, t) solve();
}

void solve(){
    int T, M;
    cin >> T >> M;
    mint::set_mod(M);
    const int L = 5'000'100;
    vector<mint> fact(L + 1);
    fact[0] = 1;
    rep(i, 0, L) fact[i + 1] = fact[i] * (i + 1);
    vector<mint> dp2(L + 2);
    dp2[0] = 1;
    rep(i, 0, L){
        dp2[i + 1] += dp2[i] * 2;
        dp2[i + 2] += dp2[i] * (i + 1) * 2;
    }
    vector<mint> dp4(L + 2);
    dp4[0] = 1;
    rep(i, 0, L){
        dp4[i + 1] += dp4[i];
        dp4[i + 2] += dp4[i] * (i + 1);
    }
    vector<mint> p2(L + 1, 1);
    rep(i, 0, L) p2[i + 1] = p2[i] * 2;
    rep(i, 0, L){
        dp4[i] -= dp2[i / 2];
        dp4[i] *= 2;
    }
    {
        mint tmp = 1;
        for (int i = 2; i <= L; i += 2){
            tmp *= 2;
            tmp *= i - 1;
            dp2[i] += tmp;
        }
    }
    rep(i, 0, L){
        dp4[i] += p2[i / 2] * fact[i / 2] - dp2[i / 2];
    }
    while (T--){
        int N;
        cin >> N;
        mint ans = fact[N] * 8;
        ans -= dp2[N / 2] * 6;
        ans -= dp4[N] * 4;
        if (N == 1) ans = 1;
        cout << ans.val() << "\n";
    }
}