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

#define li long long int
#define rep(i, to) for (li i = 0; i < ((li)(to)); i++)
#define repp(i, start, to) for (li i = (li)(start); i < ((li)(to)); i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v).end())
#define allof(v) (v).begin(), (v).end()
#define dodp(v, n) memset(v, (li)n, sizeof(v))
#define bit(n) (1ll << (li)(n))
#define mp(a, b) make_pair(a, b)
#define rin rep(i, n)
#define EPS 1e-12
#define ETOL 1e-8
#define MOD 998244353
typedef pair<li, li> PI;

#define INF bit(60)

#define DBGP 1

#define idp if (DBGP)
#define F first
#define S second
#define p2(a, b) idp cout << a << "\t" << b << endl
#define p3(a, b, c) idp cout << a << "\t" << b << "\t" << c << endl
#define p4(a, b, c, d) idp cout << a << "\t" << b << "\t" << c << "\t" << d << endl
#define p5(a, b, c, d, e) idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << endl
#define p6(a, b, c, d, e, f) idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << "\t" << f << endl
#define p7(a, b, c, d, e, f, g) idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << "\t" << f << "\t" << g << endl
#define p8(a, b, c, d, e, f, g, h) idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << "\t" << f << "\t" << g << "\t" << h << endl
#define p9(a, b, c, d, e, f, g, h, i) idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << "\t" << f << "\t" << g << "\t" << h << "\t" << i << endl
#define p10(a, b, c, d, e, f, g, h, i, j) idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << "\t" << f << "\t" << g << "\t" << h << "\t" << i << "\t" << j << endl
#define foreach(it, v) for (__typeof((v).begin()) it = (v).begin(); it != (v).end(); ++it)
#define p2p(x) idp p2((x).F, (x).S)
#define dump(x, n)                         \
    idp                                    \
    {                                      \
        rep(i, n) { cout << x[i] << " "; } \
        puts("");                          \
    }
#define dump2(x, n)                                                     \
    idp                                                                 \
    {                                                                   \
        rep(i, n) { cout << "[" << x[i].F << " , " << x[i].S << "] "; } \
        puts("");                                                       \
    }
#define dumpi(x)                  \
    idp                           \
    {                             \
        foreach (it, x)           \
        {                         \
            cout << (*it) << " "; \
        }                         \
        puts("");                 \
    }
#define dumpi2(x)                                               \
    idp                                                         \
    {                                                           \
        foreach (it, x)                                         \
        {                                                       \
            cout << "[" << (it)->F << " , " << (it)->S << "] "; \
        }                                                       \
        puts("");                                               \
    }

#define read2d(a, w, h) rep(i, h) rep(j, w) cin >> a[i][j]
#define dump2d(a, w, h)                   \
    rep(i, h)                             \
    {                                     \
        rep(j, w) cout << a[i][j] << " "; \
        puts("");                         \
    }

typedef pair<li, li> PI;

li n, k;

li comb[5050][5050]; // comb[n][r] = nCr % MOD
li b[5050]; // b[n] = 2^n % MOD

inline void prepare() {
    b[0]=1;
    repp(i,1,5050){
        b[i]=(b[i-1]*2)%MOD;
    }
    rep(i, 5050) {
        comb[i][0] = 1;
    }
    repp(i, 1, 5050) {
        repp(j, 1, i + 1) {
            comb[i][j] = (comb[i - 1][j - 1] + comb[i - 1][j]) % MOD;
        }
    }
}

inline li solve(li x) {
    li res = 0;
    li pair_num = 0;
    repp(i, 1, k + 1) {
        if (i < (x - i) && x - i <= k) {
            ++pair_num;
        }
    }
    if (x % 2 == 1) {
        // odd
        li r = max(k - pair_num * 2, 0ll);
        rep(q, pair_num + 1) {
            if (q > n) {
                continue;
            }
            li conbi_num = (comb[pair_num][q] * b[q]) % MOD;
            li bunkatsu_num = comb[(n - q) + (q + r) - 1][n - q];
            res = (res + (conbi_num * bunkatsu_num % MOD)) % MOD;
        }
    } else {
        // even
        li r = max(k - pair_num * 2 - 1, 0ll);
        rep(q, pair_num + 1) {
            if (q > n) {
                continue;
            }
            // not use x/2
            li conbi_num = (comb[pair_num][q] * b[q]) % MOD;
            li bunkatsu_num = comb[(n - q) + (q + r) - 1][n - q];
            res = (res + (conbi_num * bunkatsu_num % MOD)) % MOD;

            if (q > n - 1) {
                continue;
            }
            // use x/2 once
            li bunkatsu_num2 = comb[(n - 1 - q) + (q + r) - 1][n - 1 - q];
            res = (res + (conbi_num * bunkatsu_num2 % MOD)) % MOD;
        }
    }
    return res;
}

int main() {
    prepare();
    cin >> k >> n;

    repp(i, 2, k * 2 + 1) {
        cout << solve(i) << endl;
    }

    return 0;
}


Measured memory_bytes: 197760