from functools import cache

MOD=998244353
def matrix_pow(a,x):
    ret=[0]*36
    for i in range(6):
        ret[i*7]=1
    while x>0:
        if x&1:
            nret=[0]*36
            for i in range(6):
                for k in range(6):
                    for j in range(6):
                        nret[i*6+j]+=ret[i*6+k]*a[k*6+j]
                        nret[i*6+j]%=MOD
            ret=nret
        na=[0]*36
        for i in range(6):
            for k in range(6):
                for j in range(6):
                    na[i*6+j]+=a[i*6+k]*a[k*6+j]
                    na[i*6+j]%=MOD
        a=na
        x>>=1
    return ret

@cache
def dice(x):
    if x<0:
        return 0
    return bostan_mori(x)

q=[]
Q=[1,-1,-1,-1,-1,-1,-1]
for i in range(64):
    q.append(Q)
    V=[0]*(len(Q)*2-1)
    for i in range(len(Q)):
        for j in range(len(Q)):
            if j%2==0:
                V[i+j]+=Q[i]*Q[j]
            else:
                V[i+j]-=Q[i]*Q[j]
            V[i+j]%=MOD
    Q=V[0::2]
    
def bostan_mori(N):
    P=[1]
    k=0
    while N>0:
        U=[0]*(len(P)+6)
        for i in range(len(P)):
            for j in range(7):
                if j%2==0:
                    U[i+j]+=P[i]*q[k][j]
                else:
                    U[i+j]-=P[i]*q[k][j]
                U[i+j]%=MOD
        P=U[N&1::2]
        N>>=1
        k+=1
    return P[0]%MOD

N,M,k=map(int,input().split())
C=list(map(int,input().split()))
lst=0
for i in range(6):
    lst+=dice(N*M-1-i)*(6-i)
lst%=MOD
for c in C:
    matrix=[0]*36
    for i in range(6):
        for j in range(6):
            if j==c:
                continue
            for k in range(6):
                if j+k+1>6:
                    continue
                matrix[i*6+j]+=(dice(N-k-1-i)-dice(c-i)*dice(N-k-1-c))
            matrix[i*6+j]%=MOD
    matrix=matrix_pow(matrix,M-1)
    ans=0
    for i in range(6):
        for j in range(6):
            ans+=matrix[i]*(dice(N-j-1-i)-dice(c-i)*dice(N-j-1-c))*(6-j)
        ans%=MOD
    print((lst-ans)%MOD)