#include <bits/stdc++.h>
using namespace std;

#define LL long long
#define LB long double
#define ull unsigned long long
#define x first
#define y second
#define pb push_back
#define pf push_front
#define mp make_pair
#define Pair pair<int,int>
#define pLL pair<LL,LL>
#define pii pair<double,double>
#define LOWBIT(x) x & (-x)
// #define LOCAL true

const int INF=2e9;
const LL LINF=2e16;
const int magic=348;
const int MOD=998244353;
const double eps=1e-10;
const double pi=acos(-1);

struct fastio
{
	static const int S=1e7;
	char rbuf[S+48],wbuf[S+48];int rpos,wpos,len;
	fastio() {rpos=len=wpos=0;}
	inline char Getchar()
	{
		if (rpos==len) rpos=0,len=fread(rbuf,1,S,stdin);
		if (!len) return EOF;
		return rbuf[rpos++];
	}
	template <class T> inline void Get(T &x)
	{
		char ch;bool f;T res;
		while (!isdigit(ch=Getchar()) && ch!='-') {}
		if (ch=='-') f=false,res=0; else f=true,res=ch-'0';
		while (isdigit(ch=Getchar())) res=res*10+ch-'0';
		x=(f?res:-res);
	}
	inline void getstring(char *s)
	{
		char ch;
		while ((ch=Getchar())<=32) {}
		for (;ch>32;ch=Getchar()) *s++=ch;
		*s='\0';
	}
	inline void flush() {fwrite(wbuf,1,wpos,stdout);fflush(stdout);wpos=0;}
	inline void Writechar(char ch)
	{
		if (wpos==S) flush();
		wbuf[wpos++]=ch;
	}
	template <class T> inline void Print(T x,char ch)
	{
		char s[20];int pt=0;
		if (x==0) s[++pt]='0';
		else
		{
			if (x<0) Writechar('-'),x=-x;
			while (x) s[++pt]='0'+x%10,x/=10;
		}
		while (pt) Writechar(s[pt--]);
		Writechar(ch);
	}
	inline void printstring(char *s)
	{
		int pt=1;
		while (s[pt]!='\0') Writechar(s[pt++]);
	}
}io;

template<typename T> inline void check_max(T &x,T cmp) {x=max(x,cmp);}
template<typename T> inline void check_min(T &x,T cmp) {x=min(x,cmp);}
template<typename T> inline T myabs(T x) {return x>=0?x:-x;}
template<typename T> inline T gcd(T x,T y) {return y==0?x:gcd(y,x%y);}
inline int add(int x) {if (x>=MOD) x-=MOD;return x;}
inline int add(int x,int MO) {if (x>=MO) x-=MO;return x;}
inline int sub(int x) {if (x<0) x+=MOD;return x;}
inline int sub(int x,int MO) {if (x<0) x+=MO;return x;}
inline void Add(int &x,int y) {x=add(x+y);}
inline void Add(int &x,int y,int MO) {x=add(x+y,MO);}
inline void Sub(int &x,int y) {x=sub(x-y);}
inline void Sub(int &x,int y,int MO) {x=sub(x-y,MO);}
inline int quick_pow(int x,int y) {int res=1;while (y) {if (y&1) res=1ll*res*x%MOD;x=1ll*x*x%MOD;y>>=1;}return res;}
inline int quick_pow(int x,int y,int MO) {int res=1;while (y) {if (y&1) res=1ll*res*x%MO;x=1ll*x*x%MO;y>>=1;}return res;}

const int MAXN=2000;

int n,k;
int c[MAXN*2+48][MAXN*2+48],pw[MAXN*2+48];

inline void init_c()
{
	c[0][0]=1;
	for (register int i=1;i<=MAXN*2;i++)
	{
		c[i][0]=c[i][i]=1;
		for (register int j=1;j<=i-1;j++)
			c[i][j]=add(c[i-1][j-1]+c[i-1][j]);
	}
}

inline int C(int x,int y)
{
	if (x<y) return 0;
	return c[x][y];
}

inline void init_pw()
{
	pw[0]=1;
	for (register int i=1;i<=MAXN*2;i++) pw[i]=add(pw[i-1]+pw[i-1]);
}

inline int split(int N,int M)
{
	if (!M) return (N==0);
	return C(N+M-1,M-1);
}

inline int solve(int lim,int N,int delta)
{
	int trap=(lim>>1)-max(1,lim-k)+1,free=k-((lim&1)?(trap<<1):((trap-1)<<1|1)),ans=0;
	trap+=delta;	
	// if (lim==2 && delta==-1) cerr<<free<<' '<<trap<<"^"<<endl;
	/*
	if (lim==3)
	{
		cerr<<free<<' '<<trap<<endl;
		cerr<<dp[0][1]<<' '<<split(3,1)<<endl;
		cerr<<dp[1][1]<<' '<<split(2,1)<<endl;
		cerr<<pw[1]<<' '<<C(0,0)<<endl;
	}*/
	/*for (register int i=0;i<=N;i++) Add(ans,1ll*dp[i][trap]*split(N-i,free)%MOD);*/
	for (register int i=0;i<=trap;i++)
	{
		int curres=1ll*split(N,trap+free-i)*C(trap,i)%MOD*pw[trap-i]%MOD;
		if (i&1) Sub(ans,curres); else Add(ans,curres);
	}
	return ans;
}

int main ()
{
#ifdef LOCAL
	double TIME=clock();
	freopen ("a.in","r",stdin);
	freopen ("a.out","w",stdout);
	cerr<<"Running..."<<endl;
#endif
	init_c();init_pw();
	// cerr<<add(split(1000,5)+split(999,5))<<endl;
	// cerr<<C(1004,4)<<' '<<C(1003,4)<<endl;
	// cerr<<split(3,2)<<"#"<<endl;
	// cerr<<split(2,2)<<endl;
	io.Get(k);io.Get(n);
	// cerr<<solve(2,n-1,-1)<<' '<<solve(2,n,-1)<<endl;
	// cerr<<solve(3,n,0)<<endl;
	for (register int i=2;i<=k*2;i++)
		if (!(i&1)) io.Print(add(solve(i,n-1,-1)+solve(i,n,-1)),'\n'); else io.Print(solve(i,n,0),'\n');
	io.flush();
#ifdef LOCAL
	cerr<<"Exec Time: "<<(clock()-TIME)/CLOCKS_PER_SEC<<endl;
#endif
	return 0;
}

Measured memory_bytes: 66304