mod = 998244353


def merge(X, Y, K):
    res = X[0] * Y[0] - 1
    for i in range(1, K):
        res += X[i] * Y[K - i]
        res %= mod
    return res


def calc_dp(K, A):
    dp = [0] * K
    dp[0] = 1
    for a in A:
        tmp = [0] * K
        for i in range(K):
            tmp[i] = dp[i - a]
        for i in range(K):
            dp[i] += tmp[i]
            dp[i] %= mod
        yield dp[:]


def main():
    N, M, K = map(int, input().split())
    MM = 2 * M
    block = (N + MM - 1) // MM
    A = [0] * (block * MM)
    for i, a in enumerate(map(int, input().split())):
        A[i] = a

    answer = []
    for i in range(block):
        L = [A[j] for j in range(MM*i, MM*i+M)][::-1]
        R = [A[j] for j in range(MM*i+M, MM*i+2*M)]

        dpL = list(calc_dp(K, L))[::-1]
        dpR = list(calc_dp(K, R))

        answer.append((dpL[0][0] - 1) % mod)
        for j in range(M - 1):
            answer.append(merge(dpL[j+1], dpR[j], K))
        answer.append((dpR[M-1][0] - 1) % mod)

    print(*answer[:N - M + 1], sep="\n")


main()