#define _USE_MATH_DEFINES
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <string>
#include <vector>
#include <utility>
#include <complex>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <deque>
#include <tuple>
#include <bitset>
#include <limits>
#include <algorithm>
#include <array>
#include <random>
#include <complex>
#include <regex>
using namespace std;
typedef long double ld;
typedef long long ll;
typedef vector<int> vint;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef complex<ld> compd;
#define quickIO()	{cin.tie(0);	cout.sync_with_stdio(false);}
#define reach(i,a)	for(auto i:a)
#define rep(i,n)	for(int i=0;i<((int)n);i++)
#define REP(i,n)	for(int i=0;i<=((int)n);i++)
#define srep(i,a,n)	for(int i=a;i<((int)n);i++)
#define SREP(i,a,n)	for(int i=a;i<=((int)n);i++)
#define rrep(i,n)	for(int i=n-1;i>=0;i--)
#define RREP(i,n)	for(int i=n;i>=0;i--)
#define all(a)	(a).begin(),(a).end()
#define mp(a,b)	make_pair(a,b)
#define mt	make_tuple
#define pb	push_back
template<typename T>
istream& operator >> (istream& is, vector<T>& vec) {
	for (T& x : vec)	is >> x;
	return is;
}
template<typename T>
ostream& operator << (ostream& os, vector<T>& vec) {
	os << "[";
	rep(i, vec.size())	os << (i ? ", " : "") << vec[i];
	os << "]";
	return os;
}
template<typename T>
istream& operator >> (istream& is, pair<T, T>& p) {
	is >> p.first >> p.second;
	return is;
}
template<typename T>
ostream& operator << (ostream& os, pair<T, T>& p) {
	os << "(" << p.first << ", " << p.second << ")";
	return os;
}
int bitcnt(ll x) {
	x = ((x & 0xAAAAAAAAAAAAAAAA) >> 1) + (x & 0x5555555555555555);
	x = ((x & 0xCCCCCCCCCCCCCCCC) >> 2) + (x & 0x3333333333333333);
	x = ((x & 0xF0F0F0F0F0F0F0F0) >> 4) + (x & 0x0F0F0F0F0F0F0F0F);
	x = ((x & 0xFF00FF00FF00FF00) >> 8) + (x & 0x00FF00FF00FF00FF);
	x = ((x & 0xFFFF0000FFFF0000) >> 16) + (x & 0x0000FFFF0000FFFF);
	x = ((x & 0xFFFFFFFF00000000) >> 32) + (x & 0x00000000FFFFFFFF);
	return x;
}
int bitcnt(int x) {
	x = ((x & 0xAAAAAAAA) >> 1) + (x & 0x55555555);
	x = ((x & 0xCCCCCCCC) >> 2) + (x & 0x33333333);
	x = ((x & 0xF0F0F0F0) >> 4) + (x & 0x0F0F0F0F);
	x = ((x & 0xFF00FF00) >> 8) + (x & 0x00FF00FF);
	x = ((x & 0xFFFF0000) >> 16) + (x & 0x0000FFFF);
	return x;
}
ll sqrtll(ll x) {
	ll left = 0, right = x;
	rep(i, 100) {
		ll mid = (left + right) >> 1;
		if (mid*mid <= x)	left = mid;
		else	right = mid;
	}
	return left;
}
ll gcd(ll a, ll b) {
	return a % b == 0 ? b : gcd(b, a%b);
}
#define debug(x)	printf("Case #%d: ", x)
#define DEBUG 0
const ll inf = 1e9;
const ld infl = 1e100;
const ll mod = 998244353;
const ld eps = 1e-9;
const int dx[] = { 1,0,-1,0,0 };
const int dy[] = { 0,1,0,-1,0 };

ll nCm[4010][4010];
ll pow2[4010];

int main() {
	int k, n;	cin >> k >> n;
	nCm[0][0] = 1;
	srep(i, 1, 4010)	REP(j, i) {
		if (j)	nCm[i][j] = (nCm[i - 1][j - 1] + nCm[i - 1][j]) % mod;
		else	nCm[i][j] = nCm[i - 1][j];
	}
	pow2[0] = 1;
	srep(i, 1, 4010)	pow2[i] = (pow2[i - 1] * 2) % mod;
	SREP(i, 2, 2 * k) {
		ll ret = 0;
		if (i & 1) {
			int p = 0;
			SREP(j, 1, k) {
				if (0 < i - j && i - j <= k) {
					if (j == i - j)	p += 2;
					else	p++;
				}
			}
			int r = k - p;
			p >>= 1;
			REP(q, p) {
				// n個から先にq個(1組ずつ)取り出しておけば冪が生きる
				// 2^q * pCq * (q+r)H(n-q)
				(ret += (((pow2[q] * nCm[p][q]) % mod) * (n - q >= 0 ? nCm[r + n - 1][n - q] : 0)) % mod) %= mod;
			}
		}
		else {
			int p = 0;
			SREP(j, 1, k) {
				if (0 < i - j && i - j <= k) {
					p++;
				}
			}
			int r = k - p;
			p = (p + 1) >> 1;
			rep(q, p) {
				// without i/2
				(ret += (((pow2[q] * nCm[p - 1][q]) % mod) * (n - q >= 0 ? nCm[r + n - 1][n - q] : 0)) % mod) %= mod;
				// with i/2
				(ret += (((pow2[q] * nCm[p - 1][q]) % mod) * (n - q > 0 ? nCm[r + n - 2][n - q - 1] : 0)) % mod) %= mod;
			}
		}
		cout << ret << endl;
	}
	return 0;
}

Measured memory_bytes: 124288