import collections,sys,math,functools,operator,itertools,bisect,heapq,decimal,string,time,random
#sys.setrecursionlimit(10**9)
#sys.set_int_max_str_digits(0)
#input = sys.stdin.readline
#n = int(input())
#
#alist = []
input = sys.stdin.readline
n,m,k = map(int,input().split())
c = list(map(int,input().split()))
dp = [0 for i in range(n*m+10)]
mod = 998244353
dp[0] = 1

for i in range(len(dp)):
    for j in range(1,7):
        if i+j < len(dp):
            dp[i+j] += dp[i]
            dp[i+j] %= mod
#print(dp)

for i in c:
    ans = 0
    for j in range(6):
        ans += dp[n*m-i-1-j] * dp[i] * (6-j)
        #print(i,n*m-i-1-j)
    #pri#nt(ans)
    for j in range(6):
        if n*m-i-1-j-n < 0:
            continue
        ans += dp[n*m-i-1-j-n] * dp[i+n]* (6-j)
        #print(i+n,n*m-i-1-j-n)
    #print(ans)
    for j in range(6):
        if n*m-i-1-j-n < 0:
            continue
        ans -= dp[i] * dp[n] * dp[n*m-i-1-j-n]* (6-j)
        #print(i,n,n*m-i-1-j-n)
    #print(ans)
    print(ans%mod)