#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int N,M,K;
int C[505050];
ll dp[10101010];
ll over[10101010];
const ll mo=998244353;

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N>>M>>K;
	dp[0]=1;
	FOR(i,2*N+1) {
		for(j=1;j<=6;j++) (dp[i+j]+=dp[i])%=mo;
		for(j=max(0,i-6);j<i;j++) {
			(over[i]+=dp[j]*(7-(i-j)))%=mo;
		}
	}
	
	FOR(i,K) {
		cin>>k;
		//1周目
		ll ret=dp[k]*over[2*N-k];
		// 2周目
		(ret+=dp[N+k]*over[N-k])%=mo;
		
		//1周目は踏んで2周目も踏む
		(ret-=dp[k]*dp[N]%mo*over[N-k])%=mo;
		
		cout<<(ret%mo+mo)%mo<<endl;
	}
	
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}