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

const long long mod=998244353;

int n,m;
long long dp[220][220];

inline int read(){
	int t=0,f=1;
	register char c=getchar();
	while(c<48||c>57) f=(c=='-')?(-1):(f),c=getchar();
	while(c>=48&&c<=57) t=(t<<3)+(t<<1)+(c^48),c=getchar();
	return t*f;
}

long long digui(int d,int mg,int lg,int s,bool lian){
	long long ans=0;
	if(d==n){
		if(mg==m&&lian) return 1;
		else return 0;
	}
	if(mg>m) return 0;
	ans=(ans+(digui(d+1,mg,0,s,lian)%mod))%mod;
//	cout<<"d:"<<d<<" first:"<<ans<<endl;
	if(lg!=s) ans=(ans+(digui(d+1,mg+1,lg+1,s,((lg+1==s||lian)?(true):(false)))%mod))%mod;
//	cout<<"d:"<<d<<" second:"<<ans<<endl;
	return ans%mod;
}

int main(){
//	freopen(".in","r",stdin);
//	freopen(".out","w",stdout);
	n=read(),m=read();
	for(int i=1;i<=m;i++) printf("%lld\n",digui(0,0,0,i,false));
	return 0;
}