/*
_____
.'     '.
/  0   0  \
|     ^     |
|  \     /  |
\  '---'  /
'._____.'
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;

struct chash
{
	int operator()(int x) const
	{
		x ^= (x >> 20) ^ (x >> 12);
		return x ^ (x >> 7) ^ (x >> 4);
	}
	int operator()(long long x) const
	{
		return x ^ (x >> 32);
	}
};

template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using hashtable = gp_hash_table<T, U, chash>;

template<class T>
void readi(T &x)
{
	T input = 0;
	bool negative = false;
	char c = ' ';
	while (c < '-')
	{
		c = getchar();
	}
	if (c == '-')
	{
		negative = true;
		c = getchar();
	}
	while (c >= '0')
	{
		input = input * 10 + (c - '0');
		c = getchar();
	}
	if (negative)
	{
		input = -input;
	}
	x = input;
}
template<class T>
void printi(T output)
{
	if (output == 0)
	{
		putchar('0');
		return;
	}
	if (output < 0)
	{
		putchar('-');
		output = -output;
	}
	int aout[20];
	int ilen = 0;
	while(output)
	{
		aout[ilen] = ((output % 10));
		output /= 10;
		ilen++;
	}
	for (int i = ilen - 1; i >= 0; i--)
	{
		putchar(aout[i] + '0');
	}
	return;
}
template<class T>
void ckmin(T &a, T b)
{
	a = min(a, b);
}
template<class T>
void ckmax(T &a, T b)
{
	a = max(a, b);
}
template<class T, class U>
T normalize(T &x, U mod)
{
	if (x >= mod) x -= mod;
}
long long randomizell(long long mod)
{
	return ((1ll << 45) * rand() + (1ll << 30) * rand() + (1ll << 15) * rand() + rand()) % mod;
}
int randomize(int mod)
{
	return ((1ll << 15) * rand() + rand()) % mod;
}

#define y0 ___y0
#define y1 ___y1
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define PF push_front
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define debug(x) cerr << #x << " = " << x << endl;

const long double PI = 4.0 * atan(1.0);
const long double EPS = 1e-10;

#define MAGIC 347
#define SINF 10007
#define CO 1000007
#define PRI 998244353
#define INF 1000000007
#define BIG 1000000931
#define LARGE 1696969696967ll
#define GIANT 2564008813937411ll
#define LLINF 2696969696969696969ll
#define MAXN 2013

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;

int K, N;
int ans[MAXN];
ll dp[MAXN][MAXN], pref[MAXN][MAXN], dp1[MAXN][MAXN];

int32_t main()
{
	ios_base::sync_with_stdio(0);
	srand(time(0));
	// cout << fixed << setprecision(10);
	// cerr << fixed << setprecision(10);
	// if (fopen("input.in", "r"))
	// {
	// 	freopen ("input.in", "r", stdin);
	// 	freopen ("output.out", "w", stdout);
	// }
	cin >> K >> N;
	//N dice with sides 0...K - 1
	//FOR PAIRS:
	dp[0][0] = 1;
	for (int j = 1; j <= N + 1; j++)
	{
		pref[0][j] = 1;
	}
	for (int i = 1; i <= K; i++)
	{
		for (int j = 0; j <= N; j++)
		{
			//calculate dp[i][j] = # of ways to get a total of j using i pairs
			dp[i][j] = 2 * pref[i - 1][j] + dp[i - 1][j]; normalize(dp[i][j], PRI); normalize(dp[i][j], PRI);
			pref[i][j + 1] = pref[i][j] + dp[i][j]; normalize(pref[i][j + 1], PRI);
		}
	}
	dp1[0][0] = 1;
	for (int j = 1; j <= N + 1; j++)
	{
		pref[0][j] = 1;
	}
	for (int i = 1; i <= K; i++)
	{
		for (int j = 0; j <= N; j++)
		{
			dp1[i][j] = pref[i - 1][j + 1];
			pref[i][j + 1] = pref[i][j] + dp1[i][j]; normalize(pref[i][j + 1], PRI);
		}
	}
	for (int i = 0; i < K; i++)
	{
		bool cap = false; int pairs = 0, singles = 0;
		for (int j = 0; j < K; j++)
		{
			int x = i - j;
			if (x == j)
			{
				cap = true;
			}
			else if (0 <= x && x < K)
			{
				pairs++;
			}
			else
			{
				singles++;
			}
		}
		pairs /= 2;
		// cerr << cap << ' ' << pairs << ' ' << singles << endl;
		//for cap: you either choose 0 or 1
		//for pairs: you either choose 0 or you choose 2 and the # you want
		//for singles you can do however many you want
		//f(pairs, singles) =
		//u have N
		ll res = 0;
		for (int i = 0; i <= N; i++)
		{
			//singles guys summing up to N - i
			res += dp[pairs][i] * dp1[singles][N - i];
			res %= PRI;
		}
		if (cap)
		{
			//either u have N - 1:
			for (int i = 0; i < N; i++)
			{
				//singles guys summing up to N - 1 - i
				res += dp[pairs][i] * dp1[singles][N - 1 - i];
				res %= PRI;
			}
		}
		ans[i] = res;
	}
	for (int i = 0; i < K; i++)
	{
		cout << ans[i] << '\n';
	}
	for (int i = K - 2; i >= 0; i--)
	{
		cout << ans[i] << '\n';
	}
	// cerr << "time elapsed = " << (clock() / (CLOCKS_PER_SEC / 1000)) << " ms" << endl;
	return 0;
}


Measured memory_bytes: 95104