#include<bits/stdc++.h>
#define ll long long
using namespace std;
int N,K;
#define mod 998244353
#define MN 2005
ll fac[MN<<1],inv[MN<<1],p2[MN<<1];
ll quick_pow(ll x,ll m){
	ll res=1;
	while(m){
		if(m&1) m^=1,res=res*x%mod;
		else m>>=1,x=x*x%mod;
	}
	return res;
}
ll C(int m,int n){
	if(n<0||n>m) return 0;
	return (1LL)*fac[m]%mod*inv[n]%mod*inv[m-n]%mod;
}
ll f(int n,int k,int j){
	register int l;
	ll ans=0;
	for(l=0;l<=k;l++) ans=(ans+(p2[l]*C(n+j-1,l+j-1)%mod)*C(k,l)%mod)%mod;
	return ans;
}
ll calc(int i){
	if(K*2<=i) return 0;
	return (i-1)/2-max(0,i-1-K);
}
int main(){
	register int i;
	p2[0]=1;for(i=1;i<=4005;i++) p2[i]=p2[i-1]*2%mod;
	fac[0]=1;for(i=1;i<=4005;i++) fac[i]=fac[i-1]*i%mod;
	inv[4005]=quick_pow(fac[4005],998244351);for(i=4004;i>=0;i--) inv[i]=inv[i+1]*(i+1)%mod;
	scanf("%d%d",&K,&N);
	for(i=2;i<=K*2;i++){
		ll box=calc(i);
		if(i&1) printf("%lld\n",f(N,box,K-box*2)%mod);
		else printf("%lld\n",(f(N,box,K-1-box*2)+f(N-1,box,K-1-box*2))%mod);
	}
	return 0;
}