#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using L = __int128;

const int mod = 998244353;
int norm(int x) { return x >= mod ? x - mod : x; }
int reduce(int x) { return x < 0 ? x + mod : x; }
int neg(int x) { return x ? mod - x : 0; }
void add(int &x, int y) { if ((x += y - mod) < 0) x += mod; }
void sub(int &x, int y) { if ((x -= y) < 0) x += mod; }
void fam(int &x, int y, int z) { x = (x + (ll)y * z) % mod; }
int mpow(int a, int b) {
  int ret = 1;
  for (; b; b >>= 1) {
    if (b & 1) ret = (ll)ret * a % mod;
    a = (ll)a * a % mod;
  }
  return ret;
}

pair<vector<int>, vector<int>> berlekampMassey(int n, const vector<int> &base) {
  vector<int> u(n * 2 + 1), v(n * 2), x, y(1, 1);
  u[n * 2] = 1;
  for (int i = 0; i < v.size(); ++i) v[i] = base[i];
  while (1) {
    while (!v.empty() && !v.back()) v.pop_back();
    if (v.size() - 1 < n && y.size() - 1 <= n) break;
    x.resize(max(x.size(), u.size() - v.size() + y.size()));
    int t = neg(mpow(v.back(), mod - 2));
    for (int i = u.size() - v.size(); i >= 0; --i) {
      int c = (ll)t * u[i + v.size() - 1] % mod;
      for (int j = 0; j < y.size(); ++j) fam(x[i + j], c, y[j]);
      for (int j = 0; j < v.size(); ++j) fam(u[i + j], c, v[j]);
    }
    swap(u, v), swap(x, y);
  }
  int inv = mpow(y[0], mod - 2);
  for (int i = 0; i < y.size(); ++i) y[i] = (ll)y[i] * inv % mod;
  for (int i = 0; i < v.size(); ++i) v[i] = (ll)v[i] * inv % mod;
  return make_pair(v, y);
}

int bostanMori(ll n, vector<int> p, vector<int> q) {
  p.resize(q.size() - 1);
  vector<int> u(p.size()), v(q.size());
  for (; n; n >>= 1) {
    for (int i = 0; i < v.size(); ++i) {
      L t = 0;
      int id = i << 1;
      for (int j = 0; j <= id; ++j)
        if (j < q.size() && id - j < q.size())
          t += (ll)(j & 1 ? mod - q[j] : q[j]) * q[id - j];
      v[i] = t % mod;
    }
    for (int i = 0; i < u.size(); ++i) {
      L t = 0;
      int id = (i << 1) | (n & 1);
      for (int j = 0; j <= id; ++j)
        if (j < q.size() && id - j < p.size())
          t += (ll)(j & 1 ? mod - q[j] : q[j]) * p[id - j];
      u[i] = t % mod;
    }
    p = u, q = v;
  }
  return (ll)p[0] * mpow(q[0], mod - 2) % mod;
}
int bostanMori(ll n, pair<vector<int>, vector<int>> f) {
  return bostanMori(n, f.first, f.second);
}

const int K = 8;
const int B = 2e3;

int T, m, k;
ll n;
int inv[K + 2];
int f[B + 5][K + 1][K + 1][K + 1];

int main() {
  scanf("%d%d%d", &T, &m, &k);
  inv[1] = 1;
  for (int i = 2; i <= k + 1; ++i) inv[i] = (ll)(mod - mod / i) * inv[mod % i] % mod;
  for (int i = 1; i <= B; ++i)
    for (int a = 0; a <= k; ++a)
      for (int b = 0; a + b <= k; ++b)
        for (int c = 0; a + b + c <= k; ++c) {
          f[i][a][b][c] = (f[i][a][b][c] + (ll)(f[i - 1][a][b][c] + 1) * inv[a + b + c + 1]) % mod;
          if (a) f[i][a][b][c] = (f[i][a][b][c] + (ll)f[i - 1][a - 1][b][c] * a % mod * inv[a + b + c + 1]) % mod;
          if (b) f[i][a][b][c] = (f[i][a][b][c] + (ll)f[i - 1][a + 1][b - 1 + (a + b + c < k && m == 2)][c + (a + b + c < k && m == 3)] * b % mod * inv[a + b + c + 1]) % mod;
          if (c) f[i][a][b][c] = (f[i][a][b][c] + (ll)f[i - 1][a][b + 1][c - 1 + (a + b + c < k)] * c % mod * inv[a + b + c + 1]) % mod;
        }
  vector<int> base(B + 1);
  for (int i = 0; i <= B; ++i) base[i] = f[i][m == 1][m == 2][m == 3];
  auto f = berlekampMassey(base.size() >> 1, base);
  printf("%d\n", f.second.size());
  for (; T; --T) scanf("%lld", &n), printf("%d\n", bostanMori(n, f));
}