#include <bits/stdc++.h>
using namespace std;
const int mod=998244353,N=200010;
int n,m,sum[N];
void dfs(int i,int num,int maxx,int s){
	if(num>m||maxx>m||s>m||i>n){
		return;
	}
	if(i==n&&num==m){
		sum[maxx]++;
		sum[maxx]%=mod;
		return;
	}
	else{
		dfs(i+1,num+1,max(maxx,s+1),s+1);
		dfs(i+1,num,maxx,0);
	}
}
int main(){
	freopen("combos.in","r",stdin);
	freopen("combos.out","w",stdout); 
	scanf("%d%d",&n,&m);
	dfs(0,0,0,0);
	for(int i=1;i<=m;i++){
		printf("%d\n",sum[i]);	
	}
	return 0;
}