#include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
using ll = long long;
const ll mod = 998244353;
#define fi first
#define se second
#define rep(i,n) for(ll i=0;i<n;i++)
#define all(x) x.begin(),x.end()
#define faster ios::sync_with_stdio(false);cin.tie(nullptr)

int main() {
    ll N,M,K;
    cin >> N >> M >> K;
    vector<ll> C(K);
    rep(i,K) cin >> C[i];
    vector<ll> dp(N*M,0);
    dp[0]=1;
    for(ll i=1;i<N*M;i++){
        for(ll j=1;j<=6;j++){
            if(i<j) continue;
            dp[i]+=dp[i-j];
            dp[i]%=mod;
        }
    }
    rep(i,K){
        ll ANS=0;
        rep(j,6){
            ANS+=dp[C[i]]*((dp[N*M-j-1-C[i]]*(6-j))%mod);
            ANS%=mod;
        }
        rep(j,6){
            if(N*M-j-1-C[i]-N<0) continue;
            ANS+=dp[C[i]+N]*((dp[N*M-j-1-C[i]-N]*(6-j))%mod);
            ANS%=mod;
        }
        rep(j,6){
            if(N*M-j-1-C[i]-N<0) continue;
            ANS+=mod*mod-((dp[C[i]]*dp[N])%mod)*((dp[N*M-j-1-C[i]-N]*(6-j))%mod);
            ANS%=mod;
        }
        cout << ANS << endl;
    }
    return 0;
}