from fractions import Fraction

T = int(input())
for testcase in range(T):
    
    # 入力を受け取る
    N, K = map(int, input().split())

    # 解が収束するまでループを回す
    x = [0] * N
    for i in range(2000):
        for j in range(N):
            avg = 0
            for d in range(-K, K + 1):
                if j + d < 0 or j + d >= N: continue
                avg += x[j + d]
            x[j] = 1 + avg / (2 * K + 1)
    
    # 有理数に近似して mod 998244353 に直す
    ans = [0] * N
    for i in range(N):
        frc = Fraction(x[i]).limit_denominator(1000000)
        ans[i] = frc.numerator * pow(frc.denominator, -1, 998244353) % 998244353
    
    # 答えを出力
    print(*ans)