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

template <int Mod, bool IsPrime = false>
class mod_int {
    using ll = long long;

public:
    constexpr mod_int() : n(0) {}
    constexpr mod_int(int n_) : n(n_) {
        if(n >= Mod)     n %= Mod;
        else if(n < 0) n = (n % Mod + Mod) % Mod;
    }
    constexpr mod_int(ll n_) : n(n_) { n = (n + Mod) % Mod; }

    constexpr operator int() const { return n; }
    constexpr operator ll() const  { return n; }

    constexpr bool operator==(mod_int const& other) const { return n == other.n; }
    constexpr mod_int& operator+=(mod_int const& other) {
        if((n += other.n) >= Mod) n -= Mod;
        return *this;
    }
    constexpr mod_int& operator-=(mod_int const& other) {
        if((n += Mod - other.n) >= Mod) n -= Mod;
        return *this;
    }
    constexpr mod_int& operator*=(mod_int const& other) {
        n = (unsigned long long)n * other.n % Mod;
        return *this;
    }
    constexpr typename std::enable_if<IsPrime, mod_int>::type& operator/=(mod_int const& other) {
        return *this *= other.inverse();
    }
    constexpr mod_int operator+(mod_int other) const { return mod_int(*this) += other; }
    constexpr mod_int operator-(mod_int other) const { return mod_int(*this) -= other; }
    constexpr mod_int operator*(mod_int other) const { return mod_int(*this) *= other; }
    constexpr mod_int operator/(mod_int other) const { return mod_int(*this) /= other; }

    constexpr typename std::enable_if<IsPrime, mod_int>::type inverse() const {
        ll a = n, b = Mod, u = 1, v = 0;
        while(b) {
            ll t = a / b;
            a -= t * b; std::swap(a, b);
            u -= t * v; std::swap(u, v);
        }
        return mod_int(u);
    }

private:
    ll n;
};

template <int Mod, bool IsPrime>
std::ostream& operator<<(std::ostream& os, mod_int<Mod, IsPrime> const& n) {
    os << (int)n;
    return os;
}

constexpr int default_mod = 998244353;

template <int Mod = default_mod>
mod_int<Mod, true> fact(int n, bool f = false) {
    static std::vector<mod_int<Mod, true>> v = {1};
    static std::vector<mod_int<Mod, true>> inv = {1};
    if(n >= static_cast<int>(v.size())) {
        const int from = v.size(), to = n + 1024;
        v.reserve(to);
        inv.reserve(to);
        for(int i = from; i < to; ++i) {
            v.push_back(v.back() * mod_int<Mod, true>(i));
            inv.push_back(inv.back() / mod_int<Mod, true>(i));
        }
    }
    return (f ? inv[n] : v[n]);
}

template <int Mod = default_mod>
mod_int<Mod, true> comb(int n, int r) { // nCr
    if(r < 0 || r > n) return 0;
    return fact<Mod>(n) * fact<Mod>(r, true) * fact<Mod>(n - r, true);
}

using ll = long long;
using mint = mod_int<default_mod, true>; // default

mint mod_pow(mint x, ll n) {
    mint res = 1;
    while(n > 0) {
        if(n & 1) res *= x;
        x *= x;
        n >>= 1;
    }
    return res;
}

int main() {
    int n, k; cin >> k >> n;
    vector<int> cnt(2 * k + 1);
    for(int i = 1; i <= k; ++i) {
        for(int j = i; j <= k; ++j) {
            cnt[i + j] += 1;
        }
    }

    for(int i = 2; i <= 2 * k; ++i) {
        if(i & 1) {
            mint ans;
            const int free = k - 2 * cnt[i];
            for(int j = 0; j <= cnt[i]; ++j) {
                ans += mod_pow(2, j) * comb(cnt[i], j) * comb(n + free - 1, free - 1 + j);
            }
            cout << ans << endl;
        } else {
            mint ans;
            const int free = k - 2 * (cnt[i] - 1) - 1;
            for(int j = 0; j <= cnt[i] - 1; ++j) {
                // not use i / 2
                ans += mod_pow(2, j) * comb(cnt[i] - 1, j) * comb(n + free - 1, free - 1 + j);
                // use i / 2
                ans += mod_pow(2, j) * comb(cnt[i] - 1, j) * comb(n + free - 2, free - 1 + j);
            }
            cout << ans << endl;
        }
    }
}


Measured memory_bytes: 384