#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
using mint = modint998244353;
const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, m, k; cin >> n >> m >> k;
	vector<int>c(k);
	rep(i, k)cin >> c[i];
	vector<mint>dp(m * n);
	dp[0] = 1;
	rep(i, n * m) {
		rep2(j, 1, 7) {
			int k = i + j;
			if (k >= m * n)break;
			dp[k] += dp[i];
		}
	}
	vector<mint>ans(n);
	rep(t, 2) {
		rep(i, n) {
			int st = i + t * n;
			rep2(j, 1, 7) {
				int ed = n * m - j;
				if (st > ed)continue;
				ans[i] += dp[st] * dp[ed - st] * (7 - j);
			}
		}
	}
	rep(i, n) {
		int p = i + 0;
		int q = i + n;
		rep2(j, 1, 7) {
			int r = n * m - j;
			if (q > r)continue;
			ans[i] -= dp[p] * dp[q - p] * dp[r - q] * (7 - j);
		}
	}
	rep(i, k)cout << ans[c[i]].val() << endl;
	//rep(i, n)cout << ans[i].val() << endl;
	return 0;
}