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

void solve(){
    int n, k;
    cin >> n >> k;
    vector A(n, valarray<mint>(n + 1));
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            if(abs(i - j) <= k) A[i][j] = (i == j ? 2 * k : -1);
        }
    }
    for(int i = 0; i < n; i++) A[i][n] = 2 * k + 1;
    int rank = 0;
    for(int j = 0; j < n; j++){
        int pivot = -1;
        for(int i = rank; i < n; i++){
            if(A[i][j] != 0){
                pivot = i;
                break;
            }
        }
        if(pivot == -1) continue;
        swap(A[pivot], A[rank]);
        mint div = mint(1) / A[rank][j];
        A[rank] *= div;
        for(int i = 0; i < n; i++){
            if(i == rank) continue;
            if(A[i][j] != 0) A[i] -= A[i][j] * A[rank];
        }
        rank++;
    }
    for(int i = 0; i < n; i++){
        cout << A[i][n].val() << (i + 1 == n ? '\n' : ' ');
    }
}

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