MOD = 998244353

n, k = map(int, input().split())
p = list(map(int, input().split()))

dp = [[0] * (n + 1) for _ in range(k + 1)]
dp[0][0] = 1

for x in range(1, k + 1):
    for i in range(1, n + 1):
        current_sum = 0
        max_deque = []
        min_deque = []
        for j in range(i - 1, -1, -1):
            current_val = p[j]
            while max_deque and p[max_deque[-1]] <= current_val:
                max_deque.pop()
            max_deque.append(j)
            while min_deque and p[min_deque[-1]] >= current_val:
                min_deque.pop()
            min_deque.append(j)
            current_max = p[max_deque[0]]
            current_min = p[min_deque[0]]
            if current_max - current_min + 1 == i - j:
                current_sum += dp[x - 1][j]
                if current_sum >= MOD:
                    current_sum -= MOD
        dp[x][i] = current_sum % MOD

for x in range(1, k + 1):
    print(dp[x][n] % MOD)