#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()

namespace po167{
template<class T>
struct Binomial{
    std::vector<T> fact_vec, fact_inv_vec;
    void extend(int m = -1){
        int n = fact_vec.size();
        if (m == -1) m = n * 2;
        if (n >= m) return;
        fact_vec.resize(m);
        fact_inv_vec.resize(m);
        for (int i = n; i < m; i++){
            fact_vec[i] = fact_vec[i - 1] * T(i);
        }
        fact_inv_vec[m - 1] = T(1) / fact_vec[m - 1];
        for (int i = m - 1; i > n; i--){
            fact_inv_vec[i - 1] = fact_inv_vec[i] * T(i);
        }
    }
    Binomial(int MAX = 0){
        fact_vec.resize(1, T(1));
        fact_inv_vec.resize(1, T(1));
        extend(MAX + 1);
    }
    T fact(int i){
        if (i < 0) return 0;
        while (int(fact_vec.size()) <= i) extend();
        return fact_vec[i];
    }
    T invfact(int i){
        if (i < 0) return 0;
        while (int(fact_inv_vec.size()) <= i) extend();
        return fact_inv_vec[i];
    }
};
}

#include <atcoder/convolution>
using mint = atcoder::modint998244353;

namespace po167{
// |f| = |g| = 2 ^ n
    template<class T>
    std::vector<T> FPS_cyclic_convolution(std::vector<T> f, std::vector<T> g){
        atcoder::internal::butterfly(f);
        atcoder::internal::butterfly(g);
        for (int i = 0; i < (int)f.size(); i++) f[i] *= g[i];
        atcoder::internal::butterfly_inv(f);
        T iz = (T)(1) / (T)(f.size());
        for (int i = 0; i < (int)f.size(); i++) f[i] *= iz;
        return f;
    }
}

vector<mint> convolution_slice(vector<mint> a, vector<mint> b, int l, int r){

    vector<mint> res(r - l);
    vector<mint> c;
    if (r < 60){
        c = atcoder::convolution(a, b);
    }
    else{
        if ((int)a.size() > r) a.resize(r);
        if ((int)b.size() > r) b.resize(r);
        int n = (int)a.size() + (int)b.size() - 2;
        int sz = 1;
        while (true){
            if (r <= sz && n < l + sz){
                break;
            }
            sz *= 2;
        }
        // cout << l << " " << r << " " << sz << endl;
        a.resize(sz);
        b.resize(sz);
        c = po167::FPS_cyclic_convolution(a, b);
    }
    rep(i, l, r) res[i - l] = c[i];
    return res;
}

// DEAR MYSTERIES / TOMOO
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int N, K;
    cin >> N >> K;
    po167::Binomial<mint> table;
    vector<mint> ans(N), res(N);

    vector<mint> g(N);
    rep(i, 0, N) g[i] = (mint(N - 1 - i)).pow(K);

    /*
     * v : 左側の (1, 2) 成分の多項式
     * 返り値 : (a, b)
     * a : (1, 2) 成分
     * b : (2, 2) 成分
     */
    auto f = [&](auto self, int l, int r, vector<mint> v) -> pair<vector<mint>, vector<mint>> {
        /*cout << "# " << l << " " << r << endl;
        for (auto x : v) cout << x.val() << " ";
        cout << endl;*/
        if (l + 1 == r){
            ans[l] = v.back();
            return {{l + 1}, {l + 1, 2}};
        }
        int m = (l + r) / 2;

        vector<mint> nv;

        // v のサイズ調整をする
        // m - l しかいらない
        nv.resize(m - l);
        for (int i = 0; i < m - l; i++) nv[i] = v[i + r - m];
        auto [LA, LB] = self(self, l, m, nv);

        // v の更新をする
        // nv = v * LB + g * fact(l) * LA
        {
            nv.resize(r - m);
            auto nv1 = convolution_slice(v, LB, m - l, r - l);
            vector<mint> ng(r - l);
            rep(i, 0, r - l) ng[i] = g[i + N - r + l];
            auto nv2 = convolution_slice(ng, LA, m - l, r - l);
            rep(i, 0, r - m) nv[i] = nv1[i] + nv2[i] * table.fact(l);
        }
        auto [RA, RB] = self(self, m, r, nv);
        
        if (r == N) return {{}, {}};

        // A, B を返す
        // A = LA * RB + fact(l, m) * RA
        // B = LB * RB
        vector<mint> nA, nB;
        nA = atcoder::convolution(LA, RB);
        rep(i, 0, RA.size()){
            nA[i] += RA[i] * table.fact(m) * table.invfact(l);
        }
        nB = atcoder::convolution(LB, RB);
        return {nA, nB};
    };

    f(f, 0, N, g);

    rep(i, 1, N){
        res[i] = (ans[i] - ans[i - 1] * i) * table.fact(N - 1) * table.invfact(i);
    }

    mint inv2 = (mint(2)).inv();
    rep(i, 0, N){
        res[i] *= inv2;
        cout << res[i].val() << "\n";
    }
}