import sys

# sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = -1-(-1 << 31)
inf = -1-(-1 << 62)

# md = 10**9+7
md = 998244353

n, m, k = LI()
cc = LI()

dp = [0]*(2*n+1)
dp[0] = 1
for i in range(2*n):
    if i >= 6:
        dp[i+1] = dp[i]*2-dp[i-6]
    else:
        dp[i+1] = sum(dp[:i+1])
    dp[i+1] %= md

t = n*2-1
for c in cc:
    ans = 0
    for d in range(6):
        if c+n == t-d or c == t-d:
            ans += dp[t-d]*(6-d)
        elif c+n < t-d:
            ans += (dp[c]*dp[t-d-c]+dp[c+n]*dp[t-d-c-n]-dp[c]*dp[n]*dp[t-d-c-n])*(6-d)
        elif c < t-d:
            ans += (dp[c]*dp[t-d-c])*(6-d)
        ans%=md
    print(ans)