#include<cstdio>
#include<cstring>
#include<vector>
#include<map>
#include<cmath>
#include<algorithm>
#define N 2005
#define MOD 998244353
using namespace std;
int k,n;
int a[N];
int d[N][N];
int dy[N][N];
int main() {
	scanf("%d%d", &k,&n);
	int i, j;
	for (i = 1; i <= k; i++) d[1][i] = 1;
	for (i = 2; i <= n; i++) {
		int sum = 0;
		for (j = 1; j <= k; j++) {
			sum += d[i - 1][j]; sum %= MOD;
			d[i][j] = sum;
		}
	}
	dy[0][0] = 1;
	dy[1][0] = k;
	for (i = 1; i <= k; i++) {
		dy[0][i] = 1; dy[1][i] = k;
	}
	for (i = 2; i <= n; i++) {
		for (j = 1; j <= k; j++) {
			dy[i][0] += d[i][j]; dy[i][0] %= MOD;
		}
		for (int ban = 1; ban <= k; ban++) {
			dy[i][ban] = dy[i][ban - 1] - dy[i - 2][ban - 1];
			if (dy[i][ban] < 0) dy[i][ban] += MOD;
		}
	}
	for (i = 2; i <= k+1 ; i++) {
		printf("%d\n", dy[n][i / 2]);
	}
	for (i = k ; i >= 2; i--) printf("%d\n", dy[n][i / 2]);
	return 0;
}
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const ll MOD = 998244353;
const double EPS = 1e-10;
bool used[4001];
ll fact[4001], inv_fact[4001];
ll comb(ll n, ll k) {
	if (n < k) return 0;
	ll ret = fact[n];
	(ret *= inv_fact[k]) %= MOD;
	(ret *= inv_fact[n - k]) %= MOD;
	return ret;
}
ll mod_pow(ll a, ll b) {
	if (b == 0) return 1;
	if (b % 2 == 0) {
		ll x = mod_pow(a, b / 2);
		return (x*x) % MOD;
	}
	return (a*mod_pow(a, b - 1)) % MOD;
}
int main() {
	int K, N;
	cin >> K >> N;
	fact[0] = 1;
	inv_fact[0] = 1;
	for (int i = 1; i <= 4000; i++) {
		fact[i] = (fact[i - 1] * i) % MOD;
		inv_fact[i] = (inv_fact[i - 1] * mod_pow(i, MOD - 2)) % MOD;
	}
	for (int i = 2; i <= 2 * K; i++) {
		memset(used, 0, sizeof(used));
		int x = 0, y = 0;
		for (int j = 1; j <= K; j++) {
			if (used[j]) continue;
			used[j] = 1;
			if (1 <= i - j && i - j <= K) {
				if (!used[i - j]) {
					used[i - j] = 1;
					y++;
				}
			}
			else {
				x++;
			}
		}
		ll ans = 0;
		for (int j = 0; j <= min(N, y); j++) {
			ll t = comb(y, j);
			(t *= mod_pow(2, j)) %= MOD;
			(t *= comb(N + x - 1, N - j)) %= MOD;
			(ans += t) %= MOD;
		}
		if (i % 2 == 0) {
			for (int j = 0; j <= min(N - 1, y); j++) {
				ll t = comb(y, j);
				(t *= mod_pow(2, j)) %= MOD;
				(t *= comb(N + x - 2, N - 1 - j)) %= MOD;
				(ans += t) %= MOD;
			}
		}
		cout << ans << endl;
	}
}