from collections import *

N, K = map(int, input().split())
Q = deque()
for i in range(1, N + 1):
    L = defaultdict(int)
    cnt = 1
    for j in range(0, N + 1, i):
        if cnt == K + 2:
            break
        L[j] = 1
        cnt += 1        
    Q.append(L)
    
mod = 998244353
def merge(x, y):
    new = defaultdict(int)
    for kx, cx in x.items():
        for ky, cy in y.items():
            if kx + ky > N:
                continue
            new[kx + ky] += (cx * cy) % mod
    return new    

while len(Q) >= 2:
    a = Q.popleft()
    b = Q.popleft()
    c = merge(a, b)
    Q.append(c)
    
ans = [0] * (N + 1)
for k, v in Q[0].items():
    ans[k] = v % mod
    
print(*ans[1:])