#include <atcoder/modint>
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using mint = atcoder::modint998244353;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

void solve() {
  ll n, m, k;
  cin >> n >> m >> k;
  vector<mint> dp(n * m + 10);
  dp[0] = 1;
  rep(i, n * m) rep(j, 6) dp[i + j + 1] += dp[i];
  rep(ki, k) {
    ll c;
    cin >> c;
    mint ans = 0;
    for (ll g = n * m - 6; g <= n * m - 1; g++) {
      ll x = 7 - n * m + g;
      {
        ll l = c, r = g - l;
        if (r >= 0)
          ans += dp[l] * dp[r] * x;
      }
      {
        ll l = c + n, r = g - l;
        if (r >= 0)
          ans += dp[l] * dp[r] * x;
      }
      {
        ll l1 = c, l2 = n, r = g - l1 - l2;
        if (r >= 0)
          ans -= dp[l1] * dp[l2] * dp[r] * x;
      }
    }
    cout << ans.val() << '\n';
  }
}

int main() {
  std::cin.tie(nullptr);
  std::ios_base::sync_with_stdio(false);
  int T = 1;
  for (int t = 0; t < T; t++) {
    solve();
  }
  return 0;
}