import sys
from itertools import permutations
from heapq import *
from collections import deque
import random
import bisect

input = lambda :sys.stdin.readline().rstrip()
mi = lambda :map(int,input().split())
li = lambda :list(mi())

def cmb(n, r, mod):
    if ( r<0 or r>n ):
        return 0
    return (g1[n] * g2[r] % mod) * g2[n-r] % mod


mod = 998244353
N = 2*10**5
g1 = [1]*(N+1)
g2 = [1]*(N+1)
inverse = [1]*(N+1)

for i in range( 2, N + 1 ):
    g1[i]=( ( g1[i-1] * i ) % mod )
    inverse[i]=( ( -inverse[mod % i] * (mod//i) ) % mod )
    g2[i]=( (g2[i-1] * inverse[i]) % mod )
inverse[0]=0

def solve_easy(N,M,K,C):
    dp = [0] * (2*N+100)
    dp[0] = 1
    for i in range(1,2*N+100):
        for k in range(1,6+1):
            dp[i] += dp[i-k] % mod
            dp[i] %= mod
    
    def calc(t):
        res = 0
        for i in range(1,6+1):
            for j in range(i,6+1):
                if 2*N-i >= t:
                    res += dp[2*N-i-t] 
                    res %= mod
        return res

    
    res = []
    for c in C:
        ans = dp[c] * calc(c) + dp[c+N] * calc(c+N) - dp[c] * dp[N] * calc(c+N)
        ans %= mod
        res.append(ans)
    return res

N,M,K = mi()
C = li()
print(*solve_easy(N,M,K,C),sep="\n")