#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using mint = modint998244353;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, m, k;
  cin >> n >> m >> k;
  vector<mint> dp(2 * n + 6);
  dp[0] = 1;
  rep(i, 2 * n) rep(j, 6) dp[i+1+j] += dp[i];
  rep(_, k) {
    int c;
    cin >> c;
    mint ans;
    for (int x : {c, n + c}) {
      mint v1 = dp[x];
      int rest = 2 * n - x;
      mint v2;
      for (int i = rest - 6, coeff = 1; i < rest; i++, coeff++) if (i >= 0) {
        v2 += coeff * dp[i];
      }
      ans += v1 * v2;
    }
    {
      mint v1 = dp[c] * dp[n];
      int rest = n - c;
      mint v2;
      for (int i = rest - 6, coeff = 1; i < rest; i++, coeff++) if (i >= 0) {
        v2 += coeff * dp[i];
      }
      ans -= v1 * v2;
    }
    cout << ans.val() << '\n';
  }
}