#include<bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast")

#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
//const ll dy[9]={1,0,-1,0,1,1,-1,-1,0};
//const ll dx[9]={0,1,0,-1,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

const int mod = MOD9;
const int max_n = 200005;
struct mint {
  ll x; // typedef long long ll;
  mint(ll x=0):x((x%mod+mod)%mod){}
  mint operator-() const { return mint(-x);}
  mint& operator+=(const mint a) {
    if ((x += a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator-=(const mint a) {
    if ((x += mod-a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;}
  mint operator+(const mint a) const { return mint(*this) += a;}
  mint operator-(const mint a) const { return mint(*this) -= a;}
  mint operator*(const mint a) const { return mint(*this) *= a;}
  mint pow(ll t) const {
    if (!t) return 1;
    mint a = pow(t>>1);
    a *= a;
    if (t&1) a *= *this;
    return a;
  }
  bool operator==(const mint &p) const { return x == p.x; }
  bool operator!=(const mint &p) const { return x != p.x; }
  // for prime mod
  mint inv() const { return pow(mod-2);}
  mint& operator/=(const mint a) { return *this *= a.inv();}
  mint operator/(const mint a) const { return mint(*this) /= a;}
};
istream& operator>>(istream& is, mint& a) { return is >> a.x;}
ostream& operator<<(ostream& os, const mint& a) { return os << a.x;}
using vm=vector<mint>;
using vvm=vector<vm>;
struct combination {
  vector<mint> fact, ifact;
  combination(int n):fact(n+1),ifact(n+1) {
    assert(n < mod);
    fact[0] = 1;
    for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i;
    ifact[n] = fact[n].inv();
    for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i;
  }
  mint operator()(int n, int k) {
    if (k < 0 || k > n) return 0;
    return fact[n]*ifact[k]*ifact[n-k];
  }
}comb(max_n);

void solve(){
    ll n,k;cin >> n >> k;
    vector<vector<mint>> mat(n,vector<mint>(2*k+1));
    rep(i,n)mat[i][k]=k*2+1;
    rep(i,n){
        for(ll j=-k;j<=k;j++){
            if(j+i>=0&&j+i<n)mat[i][j+k]-=1;
        }
    }
    vector<mint> ans(n,2*k+1);
    /*rep(i,n){
        rep(j,2*k+1)cout << mat[i][j] <<" ";cout << endl;
    }*/
    rep(i,n){//前進消去
        //mint cof=mat[i][k];cof=cof.inv();
        //rep(j,2*k+1)mat[i][j]*=cof;ans[i]*=cof;
        repl(j,1,k+1){
            if(i+j>=n)continue;
            mint cof=-mat[i+j][k-j]/mat[i][k];
            //cout << cof << endl;
            rep(l,k+1){
                mat[i+j][k-j+l]+=cof*mat[i][k+l];
                //cout << mat[i+j][k-j+l] << endl;
            }
            ans[i+j]+=ans[i]*cof;
        }
    }
    /*rep(i,n){
        rep(j,2*k+1)cout << mat[i][j] <<" ";cout << endl;
    }*/
    vm calc(n);
    per(i,n){
        calc[i]=ans[i];
        repl(j,1,k+1){
            if(i+j>=n)continue;
            calc[i]-=calc[i+j]*mat[i][j+k];
        }
        calc[i]/=mat[i][k];
    }
    rep(i,n)cout << calc[i] <<" ";cout << endl;
}

int main(){
    ll t;cin >> t;
    while(t--)solve();
}