MOD = 998244353

def main():
    import sys
    input = sys.stdin.read().split()
    idx = 0
    N = int(input[idx]); idx +=1
    M = int(input[idx]); idx +=1
    K = int(input[idx]); idx +=1
    A = list(map(lambda x: int(x)%K, input[idx:idx+N]))
    idx +=N
    
    # Precompute the sliding windows
    # For each window, compute the DP
    for k in range(N-M+1):
        current_A = A[k:k+M]
        dp = [0]*K
        dp[0] = 1  # 初始空序列
        for num in current_A:
            new_dp = dp.copy()
            for j in range(K):
                new_dp[(j + num) % K] = (new_dp[(j + num) % K] + dp[j]) % MOD
            dp = new_dp
        ans = (dp[0] -1) % MOD  # 减去空序列
        print(ans)
        
if __name__ == "__main__":
    main()