// template version 1.0
using namespace std;
#include <iostream>
#include <bits/stdc++.h>

#define infile "../test/sample-1.in"
#define int long long
// #define INF 2147483647
#define INF 1000000000000000000LL
#define MOD 998244353

// {{{ define basic macro
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define _rrep(i,n) rrepi(i,0,n)
#define rrepi(i,a,b) for(int i=(int)(b-1);i>=(int)(a);--i)
#define rrep(...) _overload3(__VA_ARGS__,rrepi,_rrep,)(__VA_ARGS__)

#define foreach(x,a) for(auto& (x) : (a) )
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)

#define all(x) (x).begin(),(x).end()
#define sum(v) accumulate(all(v), 0)
#define sz(x) ((int)(x).size())
template<class T> inline void chmax(T &a, const T &b) { if(a < b) a = b; }
template<class T> inline void chmin(T &a, const T &b) { if(a > b) a = b; }
// n次元配列の初期化。第２引数の型のサイズごとに初期化していく。
template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
    std::fill( (T*)array, (T*)(array+N), val );
}
#define fill(x,y) memset(x,y,sizeof(x))
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define uni(x) sort(all(x));x.erase(unique(all(x)),x.end())
#define ten(n) ((int)1e##n)

template <class T = int>
T in() {T x; cin>>x; return (x);}

struct Fast {
  Fast(){
    std::cin.tie(0);
    ios::sync_with_stdio(false);
  }
} fast;
// }}}
//{{{ dump macro
#ifdef PCM
  #include "dump.hpp"
#else
  #define dump(...) 42
  #define dump_1d(...) 42
  #define dump_2d(...) 42
#endif
//}}}
//{{{ others
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long double ld;
typedef pair<int,int> pii;
typedef tuple<int,int,int> iii;
template<typename T>
using PQ = priority_queue<T, vector<T>, greater<T>>;

int dx[]={1, -1, 0, 0};
int dy[]={0, 0, 1, -1};
//}}}

int dp1[2001][2001];
int dp2[2001][2001];

int solve(){
  int K,N;cin>>K>>N;

  dp1[0][0] = 1;
  rep(k, 1, K+1){
    dp1[k][0] = 1;
    rep(n, 1, N+1){
      dp1[k][n] = dp1[k-1][n] + dp1[k][n-1];
      dp1[k][n] %= MOD;
    }
  }
  // dump_2d(dp1, K+1, N+1);

  dp2[0][0] = 1;
  rep(k, 1, K+1){
    dp2[k][0] = 1;
    rep(n, 1, N+1){
      dp2[k][n] = dp2[k-1][n] + dp2[k][n-1] + dp2[k-1][n-1];
      dp2[k][n] %= MOD;
    }
  }
  // dump_2d(dp2, K+1, N+1);

  rep(i, 2, 2*K+1){
    int orgi=i;
    if (i>=K+2) i=2*(K+1)-i;
    int p_num;
    int ans = 0;
    if (i%2!=0){  // no exist center
      p_num = (i-1)/2;
      rep(n, N+1){
        dump(K-2*p_num, N-n, n, p_num);
        ans += dp1[K-2*p_num][N-n] * dp2[p_num][n];
        ans %= MOD;
      }
      cout << ans << endl;
    }
    if (i%2==0){  // exist center
      p_num = (i-1)/2;
      rep(n, N+1){
        dump(K-2*p_num, N-n, n, p_num);
        ans += dp1[K-2*p_num-1][N-n] * dp2[p_num][n];
        ans %= MOD;
        if (n!=N) ans += dp1[K-2*p_num-1][(N-1)-n] * dp2[p_num][n];
        ans %= MOD;
      }
      cout << ans << endl;
    }
    i = orgi;
  }

  return 0;
}

int test(){ //{{{
  return 0;
}
//}}}

signed main() { //{{{
#ifdef INPUT_FROM_FILE
  std::ifstream in(infile);
  std::cin.rdbuf(in.rdbuf());
#endif
#ifdef PCM
  test();
#endif
  solve();
  return 0;
} //}}}


Measured memory_bytes: 62848