#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5+10,mod = 998244353;
int n,m;
int a[N];
ll ans[N];
int check(){
    int ans = 0,s = 0;
    for(int i = 1;i <= n;i++){
        if(a[i] == 1)ans++;
        else s = max(s,ans),ans = 0;
    }
    s = max(ans,s);
    return s;
}
void sou(int i,int s){
    if(s == m+1){
        int u = check();
        ans[u] = (ans[u] + 1) % mod;
        return;
    }
    if(i > n)return;
    a[i] = 1;
    sou(i+1,s+1);
    a[i] = 0; 
    sou(i+1,s);
}
int main(){
    freopen("combos.in","r",stdin);
    freopen("combos.out","w",stdout);
    scanf("%d%d",&n,&m);
    sou(1,1);
    for(int i = 1;i <= m;i++)
        printf("%lld\n",ans[i]);
    
    return 0;
    
}