MOD = 998244353

def main():
    import sys
    input = sys.stdin.read().split()
    ptr = 0
    N = int(input[ptr])
    ptr +=1
    M = int(input[ptr])
    ptr +=1
    k = int(input[ptr])
    ptr +=1
    Cs = list(map(int, input[ptr:ptr+k]))
    ptr +=k
    
    max_s = 2*N -1
    ways = [0]*(max_s +1)
    ways[0] =1
    for s in range(1, max_s+1):
        for d in range(1,7):
            if s -d >=0:
                ways[s] = (ways[s] + ways[s-d]) % MOD
    
    S =0
    for s in range(max_s+1):
        need = 2*N -s
        if need <=6:
            cnt = 7 - need
            S = (S + ways[s] * cnt) % MOD
    
    inv6 = pow(6, MOD-2, MOD)
    
    for c in Cs:
        r = c % N
        tdp = [0]*(max_s +1)
        tdp[0] =1 if 0 % N != r else 0
        for s in range(1, max_s +1):
            if s % N == r:
                tdp[s] =0
                continue
            total =0
            for d in range(1,7):
                if s -d >=0:
                    total = (total + tdp[s-d]) % MOD
            tdp[s] = total
        
        T =0
        for s in range(max_s +1):
            need = 2*N -s
            if need <=6:
                cnt =7 - need
                T = (T + tdp[s] * cnt) % MOD
        
        ans = (S - T) % MOD
        print(ans)
        
if __name__ == '__main__':
    main()