N, M, K = map(int, input().split())
C = list(map(int, input().split()))

MOD = 998244353
dp0 = [0]*(N+1)
dp0[0] = 1
for i in range(N):
    for j in range(1, 7):
        if i+j <= N:
            dp0[i+j] += dp0[i]
            dp0[i+j] %= MOD
cntN = dp0[-1]

dp = [0]*(N*M+1)
dp[0] = 1
dp2 = [0]*(N*M+1)
for i in range(N*M):
    for j in range(1, 7):
        dp[min(i+j, N*M)] += dp[i]
        dp[min(i+j, N*M)] %= MOD
        dp2[min(i+j, N*M)] += dp[i]*(7-j)
        dp2[min(i+j, N*M)] %= MOD
dp2 = dp2[::-1]

for i in range(K):
    top = dp[C[i]]*dp2[C[i]]%MOD
    bottom = dp[C[i]+N]*dp2[C[i]+N]%MOD
    minus = cntN*dp[C[i]]*dp2[C[i]+N]%MOD
    print(top+bottom-minus)