def GaussJordan_MOD(A, is_extended):
    H, W = len(A), len(A[0])

    for i in range(H):
        for j in range(W):
            A[i][j] %= MOD

    rank = 0
    for j in range(W-is_extended):
        for i in range(rank, H):
            if A[i][j] != 0:
                pivot = i
                break
        else:
            continue
        A[pivot], A[rank] = A[rank], A[pivot]
        inv = pow(A[rank][j], -1, MOD)
        for i in range(W):
            A[rank][i] *= inv
            A[rank][i] %= MOD
        for i in range(H):
            if i == rank or A[i][j] == 0:
                continue
            mul = A[i][j]
            for k in range(W):
                A[i][k] -= A[rank][k]*mul%MOD
                A[i][k] %= MOD
        rank += 1

    return rank

def linear_equation(A, B):
    H, W = len(A), len(A[0])
    for i in range(H):
        A[i].append(B[i])

    rank = GaussJordan_MOD(A, True)
    for i in range(rank, H):
        if A[i][W]:
            return None, None
    
    ans = [A[i][W] for i in range(rank)]
    C = A[:rank]
    for i in range(rank):
        C[i].pop()
    return C, ans

MOD = 998244353

for _ in range(int(input())):
    N, K = map(int, input().split())

    A = [[0]*N for _ in range(N)]
    for i in range(N):
        for j in range(max(i-K, 0), min(i+K+1, N)):
            if i == j:
                A[i][j] = 2*K%MOD
            else:
                A[i][j] = (-1)%MOD
    B = [(K*2+1)%MOD]*N

    C, ans = linear_equation(A, B)
    print(*ans)