#include <algorithm>
#include <iostream>
#include <vector>
#include <math.h>
#include <set>
#include <map>
#include <string>
#include <stack>
#include <queue>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <bitset>
#include <complex>
#include <unistd.h>
#include <cassert>
#include <cctype>
#include <random>
#define _USE_MATH_DEFINES
#define _GLIBCXX_DEBUG
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> plglg;
typedef pair<double, ll> pdlg;
typedef tuple<int, int, int> tiii;
typedef tuple<ll, ll, ll> tlglglg;
typedef tuple<double, double, double> tddd;
typedef complex<double> xy_t;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
double pi = 3.141592653589793;
ll mod = 998244353;
int intmax = 2147483647;
int intmin = -2147483648;
ll llmax = 9223372036854775807;
ll llmin = -9223372036854775807;
int iinf = intmax / 8;
ll inf = llmax / 8;
double eps = 1e-11;

ll multiply(ll x, ll y) {
    return (x % mod) * (y % mod) % mod;
}

ll modpower(ll x, ll y) {
    if (y == 0) {
        return 1;
    } else if (y == 1) {
        return x % mod;
    } else if (y % 2 == 0) {
        ll p = modpower(x, y / 2);
        return p * p % mod;
    } else {
        ll p = modpower (x, y / 2);
        return (p * p) % mod * (x % mod) % mod;
    }
}

ll divide(ll x, ll y) {
    return multiply(x, modpower(y, mod - 2));
}

ll frac[1000000];
ll invfrac[1000000];

void fracinvfrac(ll n) {
    frac[0] = 1;
    for (int i = 1; i <= n; i++) {
        frac[i] = multiply(frac[i - 1], i);
    }
    invfrac[n] = divide(1, frac[n]);
    for (int i = n - 1; i >= 0; i--) {
        invfrac[i] = multiply(invfrac[i + 1], i + 1);
    }
}

ll modcombi(ll x, ll y) {
    if (x < y || y < 0) {
        return 0;
    } else if (y == 0) {
        return 1;
    } else {
        return multiply(multiply(frac[x], invfrac[x - y]), invfrac[y]);
    }
}

ll ans[1000000];

// ll solve(ll N, ll p, ll q) {
//     ll tmp = 0;
//     tmp = multiply(modcombi(p, q), modcombi(N - q + q - 1, q - 1));
//     tmp = multiply(tmp, modpower(2, q));
//     return tmp;
// }

ll solve(ll N, ll K, ll p, ll q) {
    ll tmp = 0;
    //cout << N << " " << K << " " << p << " " << q << endl;
    tmp = multiply(modcombi(p, q), modpower(2, q));
    tmp = multiply(tmp, modcombi((N - q) + (K - 2 * p + q - 1), K - 2 * p + q - 1));
    return tmp;
}

ll solveev(ll N, ll K, ll p, ll q) {
    ll tmp = 0;
    tmp = multiply(modcombi(p, q), modpower(2, q));
    tmp = multiply(tmp, modcombi((N - q) + (K - 1 - 2 * p + q - 1), K - 1 - 2 * p + q - 1));
    return tmp;
}

int main() {
    ll K, N;
    cin >> K >> N;
    fracinvfrac(1000000);
    for (int i = 2; i <= K + 1; i++) {
        if (i % 2 != 0) {
            ll ansnum = 0;
            ll p = min((ll)(i - 1) / 2, K + 1 - (i + 1) / 2);
            for (int q = 0; q <= p; q++) {
                ll tmp = 0;
                if (N >= q) {
                    tmp = solve(N, K, p, q);
                }
                //cout << tmp << endl;
                ansnum = (ansnum + tmp) % mod;
            }
            ans[i] = ansnum;
        } else {
            ll ansnum = 0;
            ll p = min((ll)(i - 2) / 2, K + 1 - i / 2);
            for (int q = 0; q <= p; q++) {
                ll tmp = 0;
                if (N >= q) {
                    tmp = solveev(N, K, p, q);
                }
                if (N - 1 >= q) {
                    tmp = (tmp + solveev(N - 1, K, p, q)) % mod;
                }
                ansnum = (ansnum + tmp) % mod;
            }
            ans[i] = ansnum;
        }
    }
    for (int i = 2; i <= K + 1; i++) {
        cout << ans[i] << endl;
    }
    for (int i = K; i >= 2; i--) {
        cout << ans[i] << endl;
    }
}


Measured memory_bytes: 17664