#include <stdio.h>

int main () {
  int n = 0;
  int m = 0;
  int k = 0;
  int c[5000] = {};
  
  int res = 0;
  
  long long ans[500000] = {};
  long long mod_num = 998244353LL;
  
  long long dp[1000006] = {};
  long long dp_[1000006] = {};
  
  res = scanf("%d", &n);
  res = scanf("%d", &m);
  res = scanf("%d", &k);
  for (int i = 0; i < k; i++) {
    res = scanf("%d", c+i);
  }
  
  dp[0] = 1LL;
  for (int i = 0; i < n*m; i++) {
    dp[i] %= mod_num;
    for (int j = 0; j < 6; j++) {
      dp[i+j+1] += dp[i];
    }
  }
  
  for (int i = 0; i < 6; i++) {
    dp_[n*m+i] = 1LL;
  }
  
  for (int i = n*m; i > 0; i--) {
    for (int j = 0; j < 6; j++) {
      dp_[i-1] += dp_[i+j];
    }
    dp_[i-1] %= mod_num;
  }
  
  for (int i = 0; i <= n*m; i++) {
    ans[i%n] += (dp[i]*dp_[i])%mod_num;
  }
  
  for (int i = 0; i < n; i++) {
    ans[i%n] += mod_num-(((dp[i]*dp[n])%mod_num)*dp_[i+n])%mod_num;
  }
  
  for (int i = 0; i < k; i++) {
    printf("%lld\n", ans[c[i]]%mod_num);
  }
  
  return 0;
}