#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;
const int root = 5;
int pow_mod(int a, int n) {
  int r = 1;
  for (; n; n >>= 1) {
    if (n & 1) r = (long long)r * a % mod;
    a = (long long)a * a % mod;
  }
  return r;
}
void ntt(int a[], int n, int sign) {
  for (int i = 1, j = 0; i < n - 1; ++i) {
    for (int k = n >> 1; (j ^= k) < k; k >>= 1)
      ;
    if (i < j) swap(a[i], a[j]);
  }
  int wn = pow_mod(root, (mod - 1) / n);
  if (sign < 0) wn = pow_mod(wn, mod - 2);
  for (int m, mh = 1; (m = mh << 1) <= n; mh = m) {
    int wm = pow_mod(wn, n / m);
    for (int j = 0, w = 1; j < mh; ++j) {
      for (int i = j; i < n; i += m) {
        int x = a[i], y = (long long)a[i + mh] * w % mod;
        a[i] = x + y;
        a[i + mh] = x - y;
        if (a[i] >= mod) a[i] -= mod;
        if (a[i + mh] < 0) a[i + mh] += mod;
      }
      w = (long long)w * wm % mod;
    }
  }
  if (sign < 0) {
    int inv = pow_mod(n, mod - 2);
    for (int i = 0; i < n; ++i) a[i] = (long long)a[i] * inv % mod;
  }
}
vector<int> convolve(vector<int> a, vector<int> b) {
  int n = a.size() + b.size() - 1, size = n - 1;
  for (int s : {1, 2, 4, 8, 16}) size |= (size >> s);
  size += 1;
  a.resize(size);
  b.resize(size);
  ntt(a.data(), size, +1);
  ntt(b.data(), size, +1);
  for (int i = 0; i < size; ++i) a[i] = (long long)a[i] * b[i] % mod;
  ntt(a.data(), size, -1);
  return a;
}
int sum(int a, int b, int mod) {
  a += b;
  if (a >= mod) a -= mod;
  return a;
}
unordered_map<int, vector<int>> mp;
int cnt;
int k;
void solve(int n) {
  if (n <= 2) return;
  if (mp.count(n)) return;
  int a = n / 2, b = n - a;
  solve(a);
  solve(a - 1);
  if (n & 1) {
    auto &x = mp[a - 1];
    auto &y = mp[a];
    auto &z = mp[b] = vector<int>(min((int)y.size() + 1, k + 1));
    for (int i = 0; i < z.size(); i++) {
      if (i < y.size()) z[i] = sum(z[i], y[i], mod);
      if (i > 0 && i <= y.size()) z[i] = sum(z[i], y[i - 1], mod);
      if (i > 0 && i <= x.size()) z[i] = sum(z[i], x[i - 1], mod);
    }
  }
  auto p = convolve(mp[a], mp[b]);
  auto q = convolve(mp[a - 1], mp[b - 1]);
  auto &r = mp[n] = vector<int>(min((int)p.size() + 1, k + 1));
  for (int i = 0; i < r.size(); i++) {
    if (i < p.size()) r[i] = sum(r[i], p[i], mod);
    if (i > 0 && i <= q.size()) r[i] = sum(r[i], q[i - 1], mod);
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n;
  cin >> n >> k;
  mp[0] = {1};
  mp[1] = {1, 1};
  mp[2] = {1, 3, 1};
  solve(n);
  auto ans = mp[n];
  for (int i = 1; i <= k; i++)
    if (i < ans.size())
      cout << ans[i] << " \n"[i == k];
    else
      cout << 0 << " \n"[i == k];
  return 0;
}
