#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 998244353
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto& (a): (b))
#define all(v) (v).begin(),(v).end()
#define len(v) (int)(v).size()
#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end())
#define cmx(x,y) x=max(x,y)
#define cmn(x,y) x=min(x,y)
#define fi first
#define se second
#define pb push_back
#define show(x) cout<<#x<<" = "<<(x)<<endl
#define spair(p) cout<<#p<<": "<<p.fi<<" "<<p.se<<endl
#define sar(a,n) cout<<#a<<":";rep(pachico,n)cout<<" "<<a[pachico];cout<<endl
#define svec(v) cout<<#v<<":";rep(pachico,v.size())cout<<" "<<v[pachico];cout<<endl
#define svecp(v) cout<<#v<<":";each(pachico,v)cout<<" {"<<pachico.first<<":"<<pachico.second<<"}";cout<<endl
#define sset(s) cout<<#s<<":";each(pachico,s)cout<<" "<<pachico;cout<<endl
#define smap(m) cout<<#m<<":";each(pachico,m)cout<<" {"<<pachico.first<<":"<<pachico.second<<"}";cout<<endl

using namespace std;

typedef pair<int,int> P;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<double> vd;
typedef vector<P> vp;
typedef vector<string> vs;

const int MAX_N = 4005;

int inv[MAX_N],fac[MAX_N],finv[MAX_N];

void make()
{
	fac[0] = fac[1] = 1;
	finv[0] = finv[1] = 1;
	inv[1] = 1;
	for(int i=2;i<MAX_N;i++){
		inv[i] = MOD - (ll)inv[MOD%i] * (MOD/i) % MOD;
		fac[i] = (ll)fac[i-1] * i % MOD;
		finv[i] = (ll)finv[i-1] * inv[i] % MOD;
	}
}

int comb(int a,int b)
{
	if(a<b){
		return 0;
	}
	return fac[a] * ((ll)finv[b] * finv[a-b] % MOD) % MOD;
}

inline int mod_pow(int a, ll b)
{
    int res = 1;
    while(b){
        if(b & 1){
            res = (ll)res * a % MOD;
        }
        a = (ll)a * a % MOD;
        b >>= 1;
    }
    return res;
}

inline int add(int x,int y)
{
    return (x + y)%MOD;
}

inline int sub(int x,int y)
{
    return (x+MOD-y)%MOD;
}

inline int mul(int x,int y)
{
    return (ll)x*y%MOD;
}

int dp[2005][2005];

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    int K, n;
    cin >> K >> n;
    dp[0][0] = 1;
    rep(i,K){
        rep(j,n+1){
            dp[i+1][j] = add(dp[i+1][j], dp[i][j]);
            dp[i+1][j+1] = add(dp[i+1][j+1], sub(mul(2, dp[i][j]), dp[i][j]));
        }
        rep(j,n){
            dp[i+1][j+1] = add(dp[i+1][j+1], dp[i+1][j]);
        }
    }
    make();
    srep(i,2,2*K+1){
        int ans = 0;
        if(i <= K){
            if(i % 2){
                rep(j,n+1){
                    ans = add(ans, mul(dp[i/2][j], comb(n+K-i-j,K-i)));
                }
            }else{
                rep(j,n+1){
                    if(j < n){
                        ans = add(ans, mul(dp[i/2-1][j], comb(n+K-i-j-1, K-i)));
                    }
                    ans = add(ans, mul(dp[i/2-1][j], comb(n+K-i-j,K-i)));
                }
            }
        }else if(i == K+1){
            if(i % 2){
                ans = dp[i/2][n];
            }else{
                ans = add(ans, add(dp[i/2-1][n-1], dp[i/2-1][n]));
            }
        }else{
            if(i % 2){
                rep(j,n+1){
                    ans = add(ans, mul(dp[i/2-i+K+1][j], comb(n+i-K-j-2,i-K-2)));
                }
            }else{
                rep(j,n+1){
                    if(j < n){
                        ans = add(ans, mul(dp[i/2-i+K][j], comb(n+i-K-j-3,i-K-2)));
                    }
                    ans = add(ans, mul(dp[i/2-i+K][j], comb(n+i-K-j-2,i-K-2)));
                }
            }
        }
        cout << ans << "\n";
    }
    return 0;
}

Measured memory_bytes: 16000