//marico el que lo lea
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <stdlib.h>
#include <assert.h>
using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> ii;

void fastIO() {std::ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);}

#define pb push_back
#define all(obj) obj.begin(), obj.end()
#define ms(obj, val) memset(obj, val, sizeof(obj))
#define ms2(obj, val, sz) memset(obj, val, sizeof(obj[0])*sz)

#define fst first
#define snd second

template<typename T, typename U> inline void mnze(T &x, U y) {if(y < x) x = y;}
template<typename T, typename U> inline void mxze(T &x, U y) {if(x < y) x = y;}

void _scan( int &x ) { scanf("%d",&x); }
void _scan( long long &x ) { scanf("%lld",&x); }
void _scan( double &x ) { scanf("%lf",&x); }
void _scan( char &x ) { scanf(" %c",&x); }
void _scan( char *x ) { scanf("%s",x); }
template<typename T>
void _scan( vector<T> &v ){
	for(int i=0; i<(int)v.size(); i++) _scan(v[i]);
}
void scan() {}
template<typename T, typename... U>
void scan( T& head, U&... tail ) { _scan(head); scan(tail...);}

template<typename T> void _dbg(const char* sdbg, T h)
	{ cerr<<sdbg<<"="<<h<<"\n"; }
template<typename T, typename... U> void _dbg(const char* sdbg, T h, U... t) {
	while(*sdbg != ',')cerr<<*sdbg++;
	cerr<<"="<<h<<","; _dbg(sdbg+1, t...);
}

#ifdef LOCAL
#define debug(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
#define debugv(x) {{cerr<<#x<<" = "; for(auto _i:x) cerr<<_i<<", ";cerr<<"\n";}}
#define debuga(x, sz) {{cerr<<#x<<" = ";for(int _i=0;_i<sz;_i++)cerr<<x[_i]<<", ";cerr<<"\n";}}
#else
#define debug(...) (__VA_ARGS__)
#define debugv(x)
#define debuga(x, sz)
#define cerr if(0)cout
#endif

ll MOD = 998244353;

inline ll Msum(ll x){return x;}
template<typename... Rest>
inline ll Msum(ll x, Rest... rest){ return (x + Msum(rest...)) % MOD; }

inline ll Mprod(ll x){return x;}
template<typename... Rest>
inline ll Mprod(ll x, Rest... rest){ return x * Mprod(rest...) % MOD; }

inline ll Mnorm(ll x){ return (x%MOD + MOD) %MOD; }
////////////////////////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////////////////////////

const int MAXN = 2e3+3;


ll dpg[MAXN][MAXN];
ll g(int x, int n){
	if(x < 0) return 0;
	if(x == 0) return 1;
	if(n == 0) return 0;
	ll &ret = dpg[x][n];
	if(ret != -1) return ret;
	ret = g(x-1, n) + g(x, n-1);
	ret %= MOD;
	return ret;
}



ll dpf[MAXN][MAXN][2];
ll f(int x, int n, int b){
	if(x == 0) return 1;
	if(n == 0) return 0;
	ll &ret = dpf[x][n][b];
	if(ret != -1) return ret;
	if(b) ret = f(x-1, n, 1) + f(x, n-1, 0);
	else ret = 2*f(x-1, n, 1) + f(x, n-1, 0);
	ret %= MOD;
	return ret;
}

int main(){
	int n, k;
	scan(k, n);
	ms(dpf, -1);
	ms(dpg, -1);
	for(int s=2; s<=2*k; s++){
		bool even = s % 2 == 0;
		int ps = 0;
		for(int i=1; i<k; i++){
			int j = s-i;
			if(i >= j) break;
			if(j > k) continue;
			ps++;
		}
		//debug(s, ps, even);
		ll ans = 0;
		for(int x=0; x<=n; x++){
			ans = (ans + f(x, ps, 0) * g(n-x, k-2*ps-even))%MOD;
			if(even)
				ans = (ans + f(x, ps, 0) * g(n-x-1, k-2*ps-even))%MOD;
			//debug(x, ans);
		}
		printf("%lld\n", ans);
	}
}


Measured memory_bytes: 94464