/**
	author:  shobonvip
	created: 2025.04.20 17:42:14
**/

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

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)
#define all(v) v.begin(), v.end()

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

mint op(mint a, mint b) {
	return a * b;
}

mint e() {
	return 1;
}


// https://oeis.org/A000899/a000899_1.pdf
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	
	int t;cin >> t;
	int mod;cin >> mod;
	mint::set_mod(mod);

	const int mx=(int)5e6;
	vector<mint> P(mx+1);
	vector<mint> G(mx+1);
	vector<mint> R(mx+1);
	vector<mint> D(mx+1);
	vector<mint> B(mx+1);
	vector<mint> init(mx+1);
	iota(all(init),0);
	init[0]=1;
	segtree<mint,op,e> seg(init);
	
	rep(i,0,mx+1){
		P[i]=seg.prod(0,i+1);
		G[i]=seg.prod(0,i/2+1)*mint(2).pow(i/2);
		if(i%4==0||i%4==1){
			R[i]=seg.prod(i/4+1,i/4*2+1);
		}
		
		if(i==0) D[i]=1;
		else if(i==1) D[i]=D[i-1];
		else D[i]=D[i-1]+(i-1)*D[i-2];

		if(i==0) B[i]=1;
		else if(i==1) B[i]=0;
		else if(i==2) B[i]=2;
		else if(i==3) B[i]=2;
		else {
			int x=i/2*2;
			B[i]=2*B[x-2]+(x-2)*B[x-4];
		}

		/*
		cout << P[i].val() << ' ';
		cout << G[i].val() << ' ';
		cout << R[i].val() << ' ';
		cout << D[i].val() << ' ';
		cout << B[i].val() << endl;
		*/

	}
	vector<mint> ans(mx+1);
	ans[1]=1;
	rep(n,2,mx+1){
		// (2) = R[n]+B[n]
		// (4) = 2*D[n]-3*B[n]+G[n]-R[n]
		// (8) = R[n]-G[n]+2*B[n]-2*D[n]
		mint two = R[n]+B[n];
		mint four = 2*D[n]-3*B[n]+G[n]-R[n];
		mint eight = P[n]-G[n]+2*B[n]-2*D[n];
		/*
		cout << two.val() << ' ';
		cout << four.val() << ' ';
		cout << eight.val() << endl;
		*/
		ans[n] = 2*two+4*four+8*eight;		
	}

	while(t--){
		int x; cin >> x;
		cout<<ans[x].val()<<'\n';
	}

}