#include <algorithm>
#include <atcoder/modint.hpp>
#include <cassert>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <utility>
#include <vector>
using Mint = atcoder::modint998244353;
using namespace std;
using i8 = int8_t;
using i32 = int;
using i64 = long long;
// using i128 = __int128;
using u64 = unsigned long long;
using ll = long long;

void _main();
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  _main();
}

i64 pow(i64 j, i64 n) {
  i64 res = 1;
  while (n > 0) {
    if (n & 1)
      res *= j;
    j *= j;
    n >>= 1;
  }
  return res;
}

i64 n, m, k;
void _main() {
  cin >> n >> m >> k;
  vector<Mint> dp(2 * n);
  vector<Mint> dps(2 * n + 1);
  dp[0]++;
  dps[0]++;
  for (i64 i = 0; i < 2 * n; i++) {
    for (i64 j = 1; j <= 6; j++) {
      if (i + j < 2 * n) {
        dp[i + j] += dp[i];
      }
      if (i + j <= 2 * n) {
        dps[i + j] += dp[i] * (7 - j);
      }
    }
  }
  for (i64 i = 0; i < k; i++) {
    i64 c;
    cin >> c;
    Mint ans = 0;
    ans += dp[c] * dps[2 * n - c];
    ans += dp[c + n] * dps[2 * n - c - n];
    ans -= dp[c] * dp[n] * dps[2 * n - c - n];
    cout << ans.val() << "\n";
  }
}