#include <cstdio>
#include <cstring>
#include <algorithm>
#define R register
#define div why_abs_so_strong
using namespace std;
const int mod=998244353;
const int MAXN=2100;
int jc[MAXN*4];

int add(int x,int y)
{return (x+y)%mod;}
int mul(int x,int y)
{return 1LL*x*y%mod;}
int fpow(int x,int y)
{
	int ans=1;
	while(y)
	{
		if(y&1)ans=mul(ans,x);
		x=mul(x,x),y>>=1;
	}
	return ans;
}
int inv(int x)
{return fpow(x,mod-2);}
int div(int x,int y)
{return mul(x,inv(y));}
int comb(int x,int y)
{
	if(x<y)return 0;
	return div(jc[x],mul(jc[y],jc[x-y]));
}

int main()
{
	int k,n;
	scanf("%d%d",&k,&n);
	int m=k+k,n2=n>>1;
	jc[0]=1;
	for(R int i=1;i<=8000;++i)jc[i]=mul(jc[i-1],i);
	for(R int i=2;i<=m;++i)
	{
		int t1=k-i+1;
		if(t1<0)t1=-t1;
		int t2=k-t1,ans=0;
		int p=t2>>1,t3=k-t2;
		if(i%2==0)
		{
			for(R int q=0;q<=p;++q)
		    {
		    	ans=add(ans,mul(mul(comb(p,q),fpow(2,q)),comb(n+t3-1,q+t3-1)));
				ans=add(ans,mul(mul(comb(p,q),fpow(2,q)),comb(n+t3-2,q+t3-1)));
			}
		}
		else for(R int q=0;q<=p;++q)
		  ans=add(ans,mul(mul(comb(p,q),fpow(2,q)),comb(n+t3-1,q+t3-1)));
		printf("%d\n",ans);
	}
	return 0;
}