#include <bits/stdc++.h>
#define Pb push_back
using namespace std;
typedef long long ll;
const int MAXN = 2e3 + 7, Mod = 998244353;
inline int R() { int rt; scanf ( "%d", &rt ); return rt; }
inline int Mop ( int na ) { return na >= Mod ? na - Mod : na; }
inline ll Pow ( ll bs, int t ) { ll rt = 1; for ( ; t; t >>= 1, bs = bs * bs % Mod ) if ( t & 1 ) rt = rt * bs % Mod; return rt; }

ll c[MAXN << 1][MAXN << 1];

int main()
{
	int k = R(), n = R(), lm = n + k;
	for ( int i = 0; i <= lm; ++i ) c[i][0] = 1;
	for ( int i = 1; i <= lm; ++i )
		for ( int j = 1; j <= i; ++j )
			c[i][j] = Mop ( c[i - 1][j - 1] + c[i - 1][j] );
	for ( int i = 2; i <= k * 2; ++i )
	{
		int ans = 0, cnt = 0;
		for ( int j = 1; j <= i / 2; ++j ) if ( i - j <= k ) ++cnt;
		for ( int j = 0; j <= cnt && 2 * j <= n; ++j )
			ans = Mop ( ans + ( ( j & 1 ) ? Mod - 1 : 1 ) * c[cnt][j] % Mod * c[k + n - 2 * j - 1][k - 1] % Mod );
		printf ( "%d\n", Mop ( ans + Mod ) );
	}
	return 0;
}