#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;

template <typename T1, typename T2>
string print_iterable(T1 begin_iter, T2 end_iter, int counter) {
    bool done_something = false;
    stringstream res;
    res << "[";
    for (; begin_iter != end_iter and counter; ++begin_iter) {
        done_something = true;
        counter--;
        res << *begin_iter << ", ";
    }
    string str = res.str();
    if (done_something) {
        str.pop_back();
        str.pop_back();
    }
    str += "]";
    return str;
}

vector<int> SortIndex(int size, std::function<bool(int, int)> compare) {
    vector<int> ord(size);
    for (int i = 0; i < size; i++) ord[i] = i;
    sort(ord.begin(), ord.end(), compare);
    return ord;
}

template <typename T>
bool MinPlace(T& a, const T& b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

template <typename T>
bool MaxPlace(T& a, const T& b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template <typename Container>
int SZ(const Container& S) { return S.size(); }

template <typename S, typename T>
ostream& operator <<(ostream& out, const pair<S, T>& p) {
    out << "{" << p.first << ", " << p.second << "}";
    return out;
}

template <typename T>
ostream& operator <<(ostream& out, const vector<T>& v) {
    out << "[";
    for (int i = 0; i < (int)v.size(); i++) {
        out << v[i];
        if (i != (int)v.size()-1) out << ", ";
    }
    out << "]";
    return out;
}

#if DEBUG && !ONLINE_JUDGE
    ifstream input_from_file("input.txt");
    #define cin input_from_file

    #define dbg_var(x) clog << #x  << ": " << x << endl;
    #define dbg_array(x, len) clog << #x << ": " << print_iterable(x, x+len, -1) << endl;
#else
    #define dbg_var(x)
    #define dbg_array(x, len)
#endif

///////////////////////////////////////////////////////////////////////////
//////////////////// DO NOT TOUCH BEFORE THIS LINE ////////////////////////
///////////////////////////////////////////////////////////////////////////

LL Inverse(LL n, LL m) {
    n %= m;
    if (n <= 1) return n; // Handles properly (n = 0, m = 1).
    return m - ((m * Inverse(m, n) - 1) / n);
}


const int MAXN = 10000;
LL fact[MAXN], invfact[MAXN], pot2[MAXN];
const LL mod = 998244353;

LL binom(LL A, LL B) {
    if (A < B or A < 0 or B < 0) return 0;
    return ((fact[A]*invfact[B])%mod)*invfact[A-B] % mod;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0); // Remove in problems with online queries!

    fact[0] = 1, invfact[0] = 1, pot2[0] = 1;
    for (int i = 1; i < MAXN; i++) fact[i] = (fact[i-1]*i)%mod, pot2[i] = (2*pot2[i-1])%mod;
    for (int i = 1; i < MAXN; i++) invfact[i] = Inverse(fact[i], mod);

    LL K, N;
    cin >> K >> N;
    for (LL j = 2; j <= 2*K; j++) {
        LL i = j;
        if (i > K+1) i = 2*(K+1)-i;
        if (i%2) {
            LL res = 0;
            LL l = min(K/2, i/2);
            for (LL c = 0; c <= N and c <= l; c++) {
                LL l = min(K/2, i/2);
                res += (binom(N+K-i, K-i+c)*binom(l, c) % mod) * pot2[c];
                res %= mod;
            }
            cout << res << "\n";
        } else {
            LL res = 0;
            LL l = min((K-1)/2, (i-1)/2);
            for (LL c = 0; c <= N and c <= l; c++) {
                res += (binom(N+K-i, K-i+c)*binom(l, c) % mod) * pot2[c];
                res %= mod;
            }
            for (LL c = 0; c <= N-1 and c <= l; c++) {
                res += (binom(N-1+K-i, K-i+c)*binom(l, c) % mod) * pot2[c];
                res %= mod;
            }
            cout << res << "\n";
        }
    }
}


Measured memory_bytes: 512