#include <bits/stdc++.h>
#define GET_MACRO(_1,_2,_3,_4,_5,_6,_7,_8,NAME,...) NAME
#define pr(...) cerr<< GET_MACRO(__VA_ARGS__,pr8,pr7,pr6,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__) <<endl
#define pr1(a) (#a)<<"="<<(a)<<" "
#define pr2(a,b) pr1(a)<<pr1(b)
#define pr3(a,b,c) pr1(a)<<pr2(b,c)
#define pr4(a,b,c,d) pr1(a)<<pr3(b,c,d)
#define pr5(a,b,c,d,e) pr1(a)<<pr4(b,c,d,e)
#define pr6(a,b,c,d,e,f) pr1(a)<<pr5(b,c,d,e,f)
#define pr7(a,b,c,d,e,f,g) pr1(a)<<pr6(b,c,d,e,f,g)
#define pr8(a,b,c,d,e,f,g,h) pr1(a)<<pr7(b,c,d,e,f,g,h)
using namespace std;
using Int = long long;
using _int = int;
using ll = long long;
using Double = long double;
const Int INF = (1LL<<55)+1e9; // ~ 3.6 * 1e16
const Int mod = 998244353;
const Double EPS = 1e-8;
const Double PI = 6.0 * asin((Double)0.5);
using P = pair<Int,Int>;
using T = tuple<Int,Int,Int>;
template<class T> T Max(T &a,T b){return a=max(a,b);}
template<class T> T Min(T &a,T b){return a=min(a,b);}
template<class T1, class T2> ostream& operator<<(ostream& o,pair<T1,T2> p){return o<<"("<<p.first<<","<<p.second<<")";}
template<class T1, class T2, class T3> ostream& operator<<(ostream& o,tuple<T1,T2,T3> t){
  return o<<"("<<get<0>(t)<<","<<get<1>(t)<<","<<get<2>(t)<<")";}
template<class T1, class T2> istream& operator>>(istream& i,pair<T1,T2> &p){return i>>p.first>>p.second;}
template<class T> ostream& operator<<(ostream& o,vector<T> &a){Int i=0;for(T t:a)o<<(i++?" ":"")<<t;return o;}
template<class T> istream& operator>>(istream& i,vector<T> &a){for(T &t:a)i>>t;return i;}
template<class T>void prArr(T a,string s=" "){Int i=0;for(auto t:a)cout<<(i++?s:"")<<t;cout<<endl;}

Int dfs(Int K,Int len){
  const Int N = 2001;
  static _int used[N][N] = {}, mem[N][N];
  if(len == 0) return 1;
  if(K <= 0) return 0;
  if(used[K][len]++) return mem[K][len];
  Int a = dfs(K-1, len);
  Int b = dfs(K, len-1);
  Int res = (a + b) % mod;
  return mem[K][len] = res;
}

Int dfs2(Int K,Int len,Int pre){
  const Int N = 2001;
  static _int used[N][N][2] = {}, mem[N][N][2];
  if(len == 0) return 1;
  if(K <= 0) return 0;
  if(used[K][len][pre]++) return mem[K][len][pre];
  
  Int a = dfs2(K - 1, len, false);
  Int b = ((pre == false)? 2:1) * dfs2(K, len - 1, true);
  Int res = (a + b) % mod;
  return mem[K][len][pre] = res;
}

Int mult(vector<Int> a){
  Int res = 1;
  for(Int i:a) res = res * i % mod;
  return res;
}

Int calc(Int N,Int K,Int t,Int ng){
  Int cnt = 0;
  for(Int a = 1; a < t - a; a++) if(a <= K && t - a <= K && a != ng) cnt++;
  Int res = 0;
  for(Int i=0; i <= N; i++){
    Int a = dfs2(cnt, i, 0);
    Int b = dfs(K - cnt*2 - (ng != -1), N - i);
    Int num = mult({a,b});
    res = (res + num)%mod;
  }
  return res;
}

Int calcOdd(Int N, Int K, Int t){return t%2 == 0? 0:calc(N, K, t, -1);}

Int calcEven(Int N, Int K, Int t){
  if(t % 2 == 1) return 0;
  Int a = calc(N, K, t, t/2);
  Int b = calc(N - 1, K, t, t/2);
  Int res = (a + b)%mod;
  return res;
}



signed main(){
  srand((unsigned)time(NULL));
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  cout << fixed << setprecision(12);
  Int K, N;
  cin>>K>>N;

  for(Int i=2;i <= 2 * K;i++){
    Int a = calcEven(N, K, i);
    Int b = calcOdd(N, K, i);
    Int ans = (a + b)%mod;
    cout<<ans<<endl;
  }
  
  
  return 0;
}


Measured memory_bytes: 65664