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

const int mod = 998244353;

int N, K, comb[4004][4004];

int mul(int a, int b){
	long long ret = 1ll*a * b;
	return ret%mod;
}

void preprocessing(){
	for(int i = 0; i <= 4000; i++)
		comb[i][0] = comb[i][i] = 1;
	for(int i = 2; i <= 4000; i++)
		for(int j = 1; j<i; j++)
			comb[i][j] = (comb[i-1][j] + comb[i-1][j-1])%mod;
}

int solve(int ii){
	long long ret = 0;
	int X = ii/2 - max(1, ii - K)+1;
	int pm = 1;
	for(int i = 0; i <= X; i++){
		if(N < i*2)	break;
		ret = (ret + mul(pm, mul(comb[K-i*2+N-1][N-i*2], comb[X][i])) + mod)%mod;
		pm *= -1;
	}
	return ret%mod;
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	preprocessing();
	cin>>K>>N;
	for(int i = 2; i<=2*K; i++)
		cout<<solve(i)<<'\n';
	return 0;
}