#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using mint = atcoder::modint998244353;

void solve(){
    int n, k;
    cin >> n >> k;
    const int siz = 2 * k + 1;
    vector A(n, vector<mint>(siz, -1));
    vector<mint> ans(n, mint::raw(siz));
    for(int i = 0; i < n; i++){
        A[i][k] = 2 * k;
        for(int j = 0; i + j < k; j++){
            A[i][j] = mint::raw(0);
            A[n - 1 - i][2 * k - j] = mint::raw(0);
        }
    }
    for(int i = 0; i < n; i++){
        mint div = A[i][k].inv();
        for(int j = k; j < siz; j++) A[i][j] *= div;
        ans[i] *= div;
        for(int j = 1; j <= k && i + j < n; j++){
            mint coef = A[i + j][k - j];
            for(int l = k; l < siz; l++){
                A[i + j][l - j] -= coef * A[i][l];
            }
            ans[i + j] -= coef * ans[i];
        }
    }
    for(int i = n - 2; i >= 0; i--){
        for(int j = 1; j <= k && i + j < n; j++){
            ans[i] -= A[i][k + j] * ans[i + j];
        }
    }
    for(int i = 0; i < n; i++) cout << ans[i].val() << (i + 1 == n ? '\n' : ' ');
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int T;
    cin >> T;
    while(T--) solve();
}