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

template <int MOD_>
struct modnum {
	static constexpr int MOD = MOD_;
	static_assert(MOD_ > 0, "MOD must be positive");
 
private:
	using ll = long long;
 
	int v;
 
	static int minv(int a, int m) {
		a %= m;
		assert(a);
		return a == 1 ? 1 : int(m - ll(minv(m, a)) * ll(m) / a);
	}
 
public:
 
	modnum() : v(0) {}
	modnum(ll v_) : v(int(v_ % MOD)) { if (v < 0) v += MOD; }
	explicit operator int() const { return v; }
	friend std::ostream& operator << (std::ostream& out, const modnum& n) { return out << int(n); }
	friend std::istream& operator >> (std::istream& in, modnum& n) { ll v_; in >> v_; n = modnum(v_); return in; }
 
	friend bool operator == (const modnum& a, const modnum& b) { return a.v == b.v; }
	friend bool operator != (const modnum& a, const modnum& b) { return a.v != b.v; }
 
	modnum inv() const {
		modnum res;
		res.v = minv(v, MOD);
		return res;
	}
	modnum neg() const {
		modnum res;
		res.v = v ? MOD-v : 0;
		return res;
	}
 
	modnum operator- () const {
		return neg();
	}
	modnum operator+ () const {
		return modnum(*this);
	}
 
	modnum& operator ++ () {
		v ++;
		if (v == MOD) v = 0;
		return *this;
	}
	modnum& operator -- () {
		if (v == 0) v = MOD;
		v --;
		return *this;
	}
	modnum& operator += (const modnum& o) {
		v += o.v;
		if (v >= MOD) v -= MOD;
		return *this;
	}
	modnum& operator -= (const modnum& o) {
		v -= o.v;
		if (v < 0) v += MOD;
		return *this;
	}
	modnum& operator *= (const modnum& o) {
		v = int(ll(v) * ll(o.v) % MOD);
		return *this;
	}
	modnum& operator /= (const modnum& o) {
		return *this *= o.inv();
	}
 
	friend modnum operator ++ (modnum& a, int) { modnum r = a; ++a; return r; }
	friend modnum operator -- (modnum& a, int) { modnum r = a; --a; return r; }
	friend modnum operator + (const modnum& a, const modnum& b) { return modnum(a) += b; }
	friend modnum operator - (const modnum& a, const modnum& b) { return modnum(a) -= b; }
	friend modnum operator * (const modnum& a, const modnum& b) { return modnum(a) *= b; }
	friend modnum operator / (const modnum& a, const modnum& b) { return modnum(a) /= b; }
};
using num = modnum<998244353>;

const int MAXV = 4242;
const int V = 4200;
num fact[MAXV];
num ifact[MAXV];
num pow2[MAXV];
void precomp() {
	fact[0] = 1;
	for (int i = 1; i <= V; i++) {
		fact[i] = fact[i-1] * i;
	}
	ifact[V] = num(1) / fact[V];
	for (int i = V-1; i >= 0; i--) {
		ifact[i] = ifact[i+1] * (i+1);
	}

	pow2[0] = 1;
	for (int i = 1; i <= V; i++) {
		pow2[i] = pow2[i-1] * 2;
	}
}

num choose(int n, int r) {
	if (n >= r && r >= 0) {
		return fact[n] * ifact[r] * ifact[n-r];
	} else {
		return 0;
	}
}

num distribute(int n, int c) {
	return choose(n-1, c-1);
}

int N, K;

num go(int n, int k) {
	int numPairs = 0;
	for (int a = 1; a <= K; a++) {
		int b = k - a;
		if (a < b && 1 <= b && b <= K) {
			numPairs ++;
		}
	}
	int numRest = K - 2 * numPairs - (k % 2 == 0);
	num ans = 0;
	for (int take = 0; take <= numPairs; take++) {
		ans += choose(numPairs, take) * pow2[take] * distribute(n + numRest, take + numRest);
	}
	return ans;
}

int main() {
	ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	precomp();

	cin >> K >> N;
	for (int k = 2; k <= 2 * K; k++) {
		num ans = go(N, k);
		if (k % 2 == 0) {
			ans += go(N-1, k);
		}
		cout << ans << '\n';
	}

	return 0;
}


Measured memory_bytes: 384