#include<bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
using mint=modint998244353; //1000000007;
using ll=long long;
using pp=pair<int,int>;
#define sr string 
#define vc vector
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define pb push_back
#define all(v) v.begin(),v.end()
#define pque priority_queue
#define bpc(a) __builtin_popcount(a)
int main(){
  int n,m,k;cin>>n>>m>>k;
  vc<mint>dp(2*n,0); dp[0]=1;
  rep(i,2*n)for(int j=1;j<=6;j++)if(i+j<2*n)dp[i+j]+=dp[i];
  auto f=[&](int a)->mint{
    mint res=0;
    int base=2*n-a-6;
    rep(i,6)if(base+i>=0){
      res+=dp[base+i]*(1+i);
    }
    return res;
  };
  rep(z,k){
    int a;cin>>a;
    mint ans=dp[a]*f(a)+dp[a+n]*f(a+n)-dp[a]*dp[n]*f(a+n);
    cout<<ans.val()<<"\n";
  }
}