#include<bits/stdc++.h>
using namespace std;
int n,m,ans;
inline void dfs(int s,int k,int maxx,int now,int tot)
{
    if(k==n+1)
    {
        if(maxx==s&&tot==m) ans++;
        ans%=998244353;
        return;
    }
    dfs(s,k+1,maxx,0,tot);
    if(now<s&&tot<n) dfs(s,k+1,max(maxx,now+1),now+1,tot+1);
}
int main()
{
    freopen("combos.in","r",stdin);
    freopen("combos.out","w",stdout);
    cin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        ans=0;
        dfs(i,1,0,0,0);
        cout<<ans<<endl;
    }
    return 0;
}