from sys import stdin

T = int(stdin.readline())
for testcase in range(T):
    N, K = map(int, stdin.readline().split())
    # 行列を生成
    A = [[0 for j in range(N + 1)] for i in range(N)]
    for i in range(N):
        A[i][N] = 2 * K + 1
        for j in range(N):
            if abs(i - j) <= K:
                A[i][j] = 2 * K if i == j else 998244353 - 1
    # ガウスの消去法を実行
    for rank in range(N):
        div = pow(A[rank][rank], -1, 998244353)
        for j in range(rank, N + 1, 1):
            A[rank][j] *= div
            A[rank][j] %= 998244353
        for i in range(N):
            if i == rank or A[i][rank] == 0:
                continue
            coef = A[i][rank]
            for j in range(rank, N + 1, 1):
                A[i][j] -= coef * A[rank][j]
                A[i][j] %= 998244353
    print(*[A[i][N] for i in range(N)])