MOD = 998244353

def main():
    import sys
    input = sys.stdin.read
    data = input().split()
    idx = 0
    N = int(data[idx])
    idx += 1
    M = int(data[idx])
    idx += 1
    A = list(map(int, data[idx:idx + N]))
    idx += N

    # Precompute powers for each A_i up to M
    # Initialize a list of lists, where each sublist is the powers of A_i
    powers = []
    for a in A:
        if a == 0:
            powers.append([0] * (M + 1))
            continue
        pows = [1] * (M + 1)
        for k in range(1, M + 1):
            pows[k] = (pows[k - 1] * a) % MOD
        powers.append(pows)
    
    # Compute S_K for each K from 1 to M
    S = [0] * (M + 1)
    for k in range(1, M + 1):
        s = 0
        for i in range(N):
            s = (s + powers[i][k]) % MOD
        S[k] = s
    
    # Output S_1 to S_M
    print(' '.join(map(str, S[1:M+1])))

if __name__ == '__main__':
    main()