#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1e9 + 10;
const ll INFL = 4e18;

template <ll MOD>
struct modint {
    ll value;
    modint(ll x = 0) {
        if (x >= 0) {
            value = x % MOD;
        } else {
            value = MOD - (-x) % MOD;
        }
    }
    modint operator-() const {
        return modint(-value);
    }
    modint operator+() const {
        return modint(*this);
    }
    modint &operator+=(const modint &other) {
        value += other.value;
        if (value >= MOD) {
            value -= MOD;
        }
        return *this;
    }
    modint &operator-=(const modint &other) {
        value += MOD - other.value;
        if (value >= MOD) {
            value -= MOD;
        }
        return *this;
    }
    modint &operator*=(const modint other) {
        value = value * other.value % MOD;
        return *this;
    }
    modint &operator/=(modint other) {
        (*this) *= other.inv();
        return *this;
    }
    modint operator+(const modint &other) const {
        return modint(*this) += other;
    }
    modint operator-(const modint &other) const {
        return modint(*this) -= other;
    }
    modint operator*(const modint &other) const {
        return modint(*this) *= other;
    }
    modint operator/(const modint &other) const {
        return modint(*this) /= other;
    }
    modint pow(ll x) const {
        modint ret(1), mul(value);
        while (x) {
            if (x & 1) {
                ret *= mul;
            }
            mul *= mul;
            x >>= 1;
        }
        return ret;
    }
    modint inv() const {
        return pow(MOD - 2);
    }
    bool operator==(const modint &other) const {
        return value == other.value;
    }
    bool operator!=(const modint &other) const {
        return value != other.value;
    }
    friend ostream &operator<<(ostream &os, const modint &x) {
        return os << x.value;
    }
    friend istream &operator>>(istream &is, modint &x) {
        ll v;
        is >> v;
        x = modint<MOD>(v);
        return is;
    }
};
using mod998 = modint<998244353>;
using mod107 = modint<1000000007>;

using mint = mod998;

int main() {
    int N, M, K;
    cin >> N >> M >> K;
    vector<int> C(K);
    for (int i = 0; i < K; i++) {
        cin >> C[i];
    }

    vector<mint> dp(2 * N, 0);
    dp[0] = 1;
    for (int i = 1; i <= 6; i++) {
        for (int j = 0; j + i < 2 * N; j++) {
            dp[i + j] += dp[j];
        }
    }

    for (int i = 0; i < K; i++) {
        mint ans = 0;
        for (int T = 2 * N - 6; T <= 2 * N - 1; T++) {
            for (int j = 1; j <= 6; j++) {
                if (j + T >= 2 * N && T - C[i] - N >= 0) {
                    mint X = dp[C[i]] * dp[T - C[i]];
                    mint Y = dp[C[i] + N] * dp[T - (C[i] + N)];
                    mint Z = dp[C[i]] * dp[N] * dp[T - (C[i] + N)];
                    ans += X + Y - Z;
                }
            }
        }
        cout << ans << endl;
    }
}