#include<bits/stdc++.h>
using namespace std;
#define int long long
const int mo=998244353,N=5050;
int ksm(int a,int b){
	int ans=1;
	while (b){
		if (b&1) ans=ans*a%mo;
		a=a*a%mo;
		b>>=1;
	}
	return ans;
}
int _2[N],fac[N],inv[N],k,n;
int C(int x,int y){return x<y?0:fac[x]*inv[y]%mo*inv[x-y]%mo;}
signed main(){
	scanf("%lld%lld",&k,&n);
	fac[0]=1;
	_2[0]=1;
	for (int i=1;i<=n+k;++i)
		fac[i]=fac[i-1]*i%mo,_2[i]=_2[i-1]*2%mo;
	inv[n+k]=ksm(fac[n+k],mo-2);
	for (int i=n+k-1;i>=0;--i)
		inv[i]=inv[i+1]*(i+1)%mo;	
	for (int i=2;i<=2*k;++i){
		int p=abs(k-i+1),ans=0,z=(k-p)/2;
		if (i&1){
			for (int j=0;j<=z;++j){
				(ans+=C(z,j)*_2[j]%mo*C(n+p-1,p+j-1)%mo)%=mo;
			}
		}else{
			for (int j=0;j<=z;++j){
				(ans+=C(z,j)*_2[j]%mo*(C(n+p-1,p+j-1)+C(n+p-2,p+j-1))%mo)%=mo;
			}		
		}
		printf("%lld\n",ans);
	}
}
