#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
istream &operator>>(istream &is, modint &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint &a) { return os << a.val(); }
istream &operator>>(istream &is, modint998244353 &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint998244353 &a) { return os << a.val(); }
istream &operator>>(istream &is, modint1000000007 &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint1000000007 &a) { return os << a.val(); } 

typedef long long ll;
typedef vector<vector<int>> Graph;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define FOR(i,l,r) for (int i = l;i < (int)(r); i++)
#define rep(i,n) for (int i = 0;i < (int)(n); i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define my_sort(x) sort(x.begin(), x.end())
#define my_max(x) *max_element(all(x))
#define my_min(x) *min_element(all(x))
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF = (1<<30) - 1;
const ll LINF = (1LL<<62) - 1;
const int MOD = 998244353;
const int MOD2 = 1e9+7;
const double PI = acos(-1);
vector<int> di = {1,0,-1,0};
vector<int> dj = {0,1,0,-1};

#ifdef LOCAL
#  include <debug_print.hpp>
#  define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define debug(...) (static_cast<void>(0))
#endif

using mint = modint998244353;

int main(){
    cin.tie(0);
    ios_base::sync_with_stdio(false);
    int N, M, k; cin >> N >> M >> k;
    vector<mint> dp(M * N);
    dp[0] = 1;
    rep(i, M * N)FOR(j, 1, 7) if(i + j < (M * N)) dp[i + j] += dp[i];
    debug(dp);

    vector ep(6, vector<mint>(N * M + 6));
    rep(k, 6){
        ep[k][N * M + k] = 1;
        for(int v = N * M + k; v >= 0; v--){
            for(int j = 1; j <= 6; j++){
                if(v - j >= 0 && v - j < N * M) ep[k][v - j] += ep[k][v];
            }
        }
    }

    rep(i, k){
        int C; cin >> C;
        mint ans = 0, acc = 0;

        acc = 0;
        rep(k, 6) acc += ep[k][C];
        debug(dp[C], acc);
        ans += acc * dp[C];

        acc = 0;
        rep(k, 6) acc += ep[k][C + N];
        debug(dp[C + N], acc);
        ans += acc * dp[C + N];

        acc = 0;
        rep(k, 6) acc += ep[k][C + N];
        debug(dp[C], dp[N], acc);
        ans -= acc * dp[C] * dp[N];

        cout << ans << endl;
    }
}