PolandBall is standing in a row with Many Other Balls. More precisely, there are exactly n Balls. Balls are proud of their home land — and they want to prove that it's strong.

The Balls decided to start with selecting exactly m groups of Balls, each consisting either of single Ball or two neighboring Balls. Each Ball can join no more than one group.

The Balls really want to impress their Enemies. They kindly asked you to calculate number of such divisions for all m where 1 ≤ m ≤ k. Output all these values modulo 998244353, the Enemies will be impressed anyway.

Input

There are exactly two numbers n and k (1 ≤ n ≤ 109, 1 ≤ k < 215), denoting the number of Balls and the maximim number of groups, respectively.

Output

You should output a sequence of k values. The i-th of them should represent the sought number of divisions into exactly i groups, according to PolandBall's rules.

Examples

Input

3 3


Output

5 5 1 

Input

1 1


Output

1 

Input

5 10


Output

9 25 25 9 1 0 0 0 0 0 

Note

In the first sample case we can divide Balls into groups as follows: 

{1}, {2}, {3}, {12}, {23}.

{12}{3}, {1}{23}, {1}{2}, {1}{3}, {2}{3}.

{1}{2}{3}.

Therefore, output is: 5 5 1.
#include <bits/stdc++.h>
using int64 = long long;
using uchar = unsigned char;
constexpr int mxdg(262144);
constexpr int p(998244353);
constexpr int proot(3);
inline int rd() {
  static int _;
  return scanf("%d", &_), _;
}
namespace my_template {
template <class _Tp>
inline void swap(_Tp& x, _Tp& y) {
  _Tp z = x;
  x = y;
  y = z;
}
template <class _Tp>
inline int fpow(_Tp v, int n) {
  int pw = 1;
  for (; n; n >>= 1, v = (int64)v * v % p)
    if (n & 1) pw = (int64)pw * v % p;
  return pw;
}
template <class _Tpx, class _Tpy>
inline void inc(_Tpx& x, const _Tpy& y) {
  (p - y <= x) ? (x += y - p) : (x += y);
}
template <class _Tpx, class _Tpy>
inline void dec(_Tpx& x, const _Tpy& y) {
  x -= y;
  (x < 0) && (x += p);
}
template <class _Tpx, class _Tpy>
inline _Tpx pls(const _Tpx& x, const _Tpy& y) {
  return (x < p - y) ? (x + y) : (x - p + y);
}
template <class _Tpx, class _Tpy>
inline _Tpx sub(const _Tpx& x, const _Tpy& y) {
  return (x < y) ? (x - y + p) : (x - y);
}
template <class _Tp>
inline _Tp gcd(const _Tp& x, const _Tp& y) {
  return y ? gcd(y, x % y) : x;
}
template <class _Tp>
inline _Tp lcm(const _Tp& x, const _Tp& y) {
  return x / gcd(x, y) * y;
}
template <class _Tp, class _Tpx>
inline void exgcd(const _Tp& x, const _Tp& y, _Tpx& a, _Tpx& b) {
  if (y)
    exgcd(y, x % y, b, a), b -= x / y * a;
  else
    a = 1, b = 0;
}
inline int inv(const int& v, const int& mp) {
  int x, y;
  exgcd(v, mp, x, y);
  return x < 0 ? x + mp : x;
}
template <class _Tp>
inline int div2(const _Tp& v) {
  return (v & 1) ? (v + p) >> 1 : (v >> 1);
}
template <class _Tpx, class _Tpy>
inline _Tpx Min(const _Tpx& x, const _Tpy& y) {
  return x < y ? x : y;
}
template <class _Tpx, class _Tpy>
inline _Tpx Max(const _Tpx& x, const _Tpy& y) {
  return x > y ? x : y;
}
template <class _Tpx, class _Tpy>
inline void chkMin(_Tpx& x, const _Tpy& y) {
  (x > y) && (x = y);
}
template <class _Tpx, class _Tpy>
inline void chkMax(_Tpx& x, const _Tpy& y) {
  (x < y) && (x = y);
}
template <class _Tpx, class _Tpy>
inline bool bchkMin(_Tpx& x, const _Tpy& y) {
  return (x > y) && (x = y, 1);
}
template <class _Tpx, class _Tpy>
inline bool bchkMax(_Tpx& x, const _Tpy& y) {
  return (x < y) && (x = y, 1);
}
}  // namespace my_template
namespace Hashmap {
using namespace my_template;
template <class key_tp, class val_tp>
struct link_t {
  key_tp key;
  val_tp val;
  link_t<key_tp, val_tp>* las;
  link_t() : key(key_tp(0)), val(val_tp(0)), las(nullptr) {}
  inline link_t* init(const key_tp& _key, const val_tp& _val,
                      link_t<key_tp, val_tp>* const& ls) {
    return key = _key, val = _val, las = ls, this;
  }
};
template <class key_tp, class val_tp>
struct hashmap {
  static constexpr int hashp = 100007;
  using link = link_t<key_tp, val_tp>;
  link lnk_pool[hashp * 10];
  link *lnk[hashp], *lnk_alc;
  hashmap() : lnk_alc(lnk_pool - 1) {}
  inline val_tp& operator[](const key_tp& key) {
    const val_tp hash_key = key % hashp;
    for (link* o = lnk[hash_key]; o; o = o->las)
      if (o->key == key) return o->val;
    lnk[hash_key] = (++lnk_alc)->init(key, 0, lnk[hash_key]);
    return lnk[hash_key]->val;
  }
  inline bool count(const key_tp& key) {
    const val_tp hash_key = key % hashp;
    for (link* o = lnk[hash_key]; o; o = o->las)
      if (o->key == key) return true;
    return false;
  }
  inline void clear() {
    lnk_alc = lnk_pool - 1;
    memset(lnk, 0, sizeof lnk);
  }
};
}  // namespace Hashmap
namespace poly {
using namespace my_template;
using namespace Hashmap;
using poly_t = int[mxdg];
using poly = int* const;
inline int calcpw2(const int& n) {
  int pw2 = 1;
  for (; pw2 < n; pw2 += pw2)
    ;
  return pw2;
}
int wn[mxdg], iwn[mxdg], inv[mxdg + 1];
constexpr int rt_blk(31596);
constexpr int invpw_blk(393213064);
Hashmap::hashmap<int, int> lg;
inline void polyinit() {
  const int ob = fpow(proot, (p - 1) / mxdg);
  const int iob = fpow(ob, p - 2);
  wn[0] = iwn[0] = inv[0] = inv[1] = 1;
  for (int i = 1, v = 1, iv = 1; i != mxdg; ++i) {
    v = (int64)v * ob % p;
    wn[i] = v;
    iv = (int64)iv * iob % p;
    iwn[i] = iv;
  }
  for (int i = 2; i <= mxdg; ++i) inv[i] = (int64)inv[p % i] * (p - p / i) % p;
  int b = 1;
  for (int t = 0; t < rt_blk; ++t, b = (int64)b * proot % p) lg[b] = t;
}
inline int root(const int& v, const int& k) {
  if (k == 1 || v < 2) return v;
  for (int t = 0, pw = v; t < p; t += rt_blk, pw = (int64)pw * invpw_blk % p)
    if (lg.count(pw))
      return fpow(proot,
                  (int64)(t + lg[pw]) * my_template::inv(k, p - 1) % (p - 1));
  return -1;
}
void DFT(poly& A, const int& deg) {
  for (int i = 0, j = 0; i != deg; ++i) {
    if (i < j) swap(A[i], A[j]);
    for (int k = deg >> 1; (j ^= k) < k; k >>= 1)
      ;
  }
  int* const td = A + deg;
  for (int l = 1, tp = mxdg >> 1; l < deg; l += l, tp >>= 1)
    for (int *i = A, z; i < td; i += l + l)
      for (int j = 0, *w = wn; j != l; ++j, w += tp)
        z = (int64)i[j + l] * *w % p, i[j + l] = sub(i[j], z), inc(i[j], z);
}
void IDFT(poly& A, const int& deg) {
  for (int i = 0, j = 0; i != deg; ++i) {
    if (i < j) swap(A[i], A[j]);
    for (int k = deg >> 1; (j ^= k) < k; k >>= 1)
      ;
  }
  int* const td = A + deg;
  for (int l = 1, tp = mxdg >> 1; l < deg; l += l, tp >>= 1)
    for (int *i = A, z; i < td; i += l + l)
      for (int j = 0, *w = iwn; j != l; ++j, w += tp)
        z = (int64)i[j + l] * *w % p, i[j + l] = sub(i[j], z), inc(i[j], z);
  const int invdeg = fpow(deg, p - 2);
  for (int i = 0; i != deg; ++i) A[i] = (int64)A[i] * invdeg % p;
}
inline void cp(const int* const& sl, const int* const& sr, int* const& dl,
               int* const& dr) {
  std::copy(sl, sr, dl);
  if (sr - sl < dr - dl) std::fill(dl + (sr - sl), dr, 0);
}
void polyder(const poly& f, poly& df, const int& n) {
  for (int i = 1; i != n; ++i) df[i - 1] = (int64)f[i] * i % p;
}
void polyint(const poly& f, poly& intf, const int& n) {
  for (int i = n - 1; i; --i) intf[i] = (int64)f[i - 1] * inv[i] % p;
  intf[0] = 0;
}
void poly_inv(const poly& h, poly& f, const int& n) {
  static poly_t inv_t;
  if (n == 1) return (void)(f[0] = fpow(h[0], p - 2));
  poly_inv(h, f, (n + 1) >> 1);
  const int deg = calcpw2(n + n + 3);
  cp(h, h + n, inv_t, inv_t + deg);
  DFT(inv_t, deg);
  DFT(f, deg);
  for (int i = 0; i != deg; ++i)
    f[i] = (int64)f[i] * sub(2ll, (int64)f[i] * inv_t[i] % p) % p;
  IDFT(f, deg);
  std::fill(f + n, f + deg, 0);
}
void polyinv(const poly& h, poly& f, const int& n) {
  std::fill(f, f + calcpw2(n + n + 3), 0);
  poly_inv(h, f, n);
}
void polyln(const poly& h, poly& f, const int& n) {
  static poly_t ln_t;
  assert(h[0] == 1);
  const int deg = calcpw2(n + n + 3);
  std::fill(f + n - 1, f + deg, 0);
  polyder(h, f, n);
  polyinv(h, ln_t, n);
  DFT(ln_t, deg);
  DFT(f, deg);
  for (int i = 0; i != deg; ++i) ln_t[i] = (int64)f[i] * ln_t[i] % p;
  IDFT(ln_t, deg);
  polyint(ln_t, f, n);
  std::fill(f + n, f + deg, 0);
}
void poly_exp(const poly& h, poly& f, const int& n) {
  static poly_t exp_t;
  if (n == 1) return (void)(f[0] = 1);
  poly_exp(h, f, (n + 1) >> 1);
  polyln(f, exp_t, n);
  for (int i = 0; i != n; ++i) exp_t[i] = sub(h[i], exp_t[i]);
  inc(exp_t[0], 1);
  const int deg = calcpw2(n + n + 3);
  DFT(f, deg);
  DFT(exp_t, deg);
  for (int i = 0; i != deg; ++i) f[i] = (int64)f[i] * exp_t[i] % p;
  IDFT(f, deg);
  std::fill(f + n, f + deg, 0);
}
void polyexp(const poly& h, poly& f, const int& n) {
  assert(h[0] == 0);
  std::fill(f, f + calcpw2(n + n + 3), 0);
  poly_exp(h, f, n);
}
void polydiv(const poly& f, const int& n, const poly& g, const int& m, poly& Q,
             poly& R) {
  static poly_t div_t;
  const int res = n - m + 1;
  const int deg1 = calcpw2(res + res);
  std::reverse_copy(g, g + m, Q);
  if (m < deg1) std::fill(Q + m, Q + deg1, 0);
  polyinv(Q, div_t, res);
  std::reverse_copy(f + m - 1, f + n, Q);
  std::fill(Q + res, Q + deg1, 0);
  DFT(Q, deg1);
  DFT(div_t, deg1);
  for (int i = 0; i != deg1; ++i) Q[i] = (int64)Q[i] * div_t[i] % p;
  IDFT(Q, deg1);
  std::reverse(Q, Q + res);
  std::fill(Q + res, Q + deg1, 0);
  const int deg2 = calcpw2(n);
  cp(Q, Q + res, R, R + deg2);
  cp(g, g + m, div_t, div_t + deg2);
  DFT(R, deg2);
  DFT(div_t, deg2);
  for (int i = 0; i != deg2; ++i) R[i] = (int64)R[i] * div_t[i] % p;
  IDFT(R, deg2);
  for (int i = 0; i != m; ++i) R[i] = sub(f[i], R[i]);
  std::fill(R + m - 1, R + deg2, 0);
}
void polymod(const poly& f, const int& n, const poly& g, const int& m,
             poly& R) {
  static poly_t mod_t;
  const int res = n - m + 1;
  const int deg1 = calcpw2(res + res);
  std::reverse_copy(g, g + m, R);
  if (m < deg1) std::fill(R + m, R + deg1, 0);
  polyinv(R, mod_t, res);
  std::reverse_copy(f + m - 1, f + n, R);
  std::fill(R + res, R + deg1, 0);
  DFT(R, deg1);
  DFT(mod_t, deg1);
  for (int i = 0; i != deg1; ++i) R[i] = (int64)R[i] * mod_t[i] % p;
  IDFT(R, deg1);
  std::reverse(R, R + res);
  std::fill(R + res, R + deg1, 0);
  const int deg2 = calcpw2(n);
  cp(g, g + m, mod_t, mod_t + deg2);
  DFT(R, deg2);
  DFT(mod_t, deg2);
  for (int i = 0; i != deg2; ++i) R[i] = (int64)R[i] * mod_t[i] % p;
  IDFT(R, deg2);
  for (int i = 0; i != m; ++i) R[i] = sub(f[i], R[i]);
  std::fill(R + m - 1, R + deg2, 0);
}
void polysqrt(const poly& h, poly& f, const int& n) {
  static poly_t sqrt1_t, sqrt2_t;
  if (n == 1) return (void)(f[0] = root(h[0], 2));
  polysqrt(h, f, (n + 1) >> 1);
  const int deg = calcpw2(n + n + 3);
  polyinv(f, sqrt1_t, n);
  cp(h, h + n, sqrt2_t, sqrt2_t + deg);
  DFT(sqrt1_t, deg);
  DFT(sqrt2_t, deg);
  for (int i = 0; i != deg; ++i)
    sqrt1_t[i] = (int64)sqrt1_t[i] * sqrt2_t[i] % p;
  IDFT(sqrt1_t, deg);
  for (int i = (n + 1) >> 1; i != n; ++i) f[i] = div2(sqrt1_t[i]);
}
void polycbrt(const poly& h, poly& f, const int& n) {
  static constexpr int inv3(332748118);
  static poly_t cbrt1_t, cbrt2_t;
  if (n == 1) return (void)(f[0] = root(h[0], 3));
  polycbrt(h, f, (n + 1) >> 1);
  const int deg = calcpw2(n + n + 3);
  cp(f, f + ((n + 1) >> 1), cbrt1_t, cbrt1_t + deg);
  DFT(cbrt1_t, deg);
  for (int i = 0; i != deg; ++i)
    cbrt1_t[i] = (int64)cbrt1_t[i] * cbrt1_t[i] % p;
  IDFT(cbrt1_t, deg);
  polyinv(cbrt1_t, cbrt2_t, n);
  cp(h, h + n, cbrt1_t, cbrt1_t + deg);
  DFT(cbrt1_t, deg);
  DFT(cbrt2_t, deg);
  for (int i = 0; i != deg; ++i)
    cbrt1_t[i] = (int64)cbrt1_t[i] * cbrt2_t[i] % p;
  IDFT(cbrt1_t, deg);
  for (int i = (n + 1) >> 1; i != n; ++i)
    f[i] = (int64)(f[i] + f[i] + cbrt1_t[i]) * inv3 % p;
}
void polypow(const poly& h, poly& f, const int& k, const int& n) {
  static poly_t pow_t;
  if (h[0] == 1) {
    polyln(h, pow_t, n);
    for (int i = 0; i != n; ++i) pow_t[i] = (int64)pow_t[i] * k % p;
    polyexp(pow_t, f, n);
  } else {
    int lw = 0;
    for (; !h[lw]; ++lw)
      ;
    if (n <= lw * k) return std::fill(f, f + n, 0);
    const int low = lw, ilowc = fpow(h[low], p - 2);
    for (int i = 0; i != n - low; ++i) pow_t[i] = (int64)h[i + low] * ilowc % p;
    std::fill(pow_t + n - low, pow_t + n, 0);
    polyln(pow_t, f, n);
    for (int i = 0; i != n; ++i) f[i] = (int64)f[i] * k % p;
    polyexp(f, pow_t, n);
    const int pwlow = low * k, pwlowc = fpow(h[low], k);
    for (int i = 0; i != n - pwlow; ++i)
      f[i + pwlow] = (int64)pow_t[i] * pwlowc % p;
    std::fill(f, f + pwlow, 0);
  }
}
void polyroot(const poly& h, poly& f, const int& k, const int& n) {
  static poly_t root_t;
  const int invk(fpow(k, p - 2));
  if (h[0] == 1) {
    polyln(h, root_t, n);
    for (int i = 0; i != n; ++i) root_t[i] = (int64)root_t[i] * invk % p;
    polyexp(root_t, f, n);
  } else {
    int lw = 0;
    for (; !h[lw]; ++lw)
      ;
    assert(lw % k == 0);
    const int low = lw, ilowc = fpow(h[low], p - 2);
    for (int i = 0; i != n - low; ++i)
      root_t[i] = (int64)h[i + low] * ilowc % p;
    std::fill(root_t + n - low, root_t + n, 0);
    polyln(root_t, f, n);
    for (int i = 0; i != n; ++i) f[i] = (int64)f[i] * invk % p;
    polyexp(f, root_t, n);
    const int pwlow = low / k, pwlowc = root(h[low], k);
    for (int i = 0; i != n - pwlow; ++i)
      f[i + pwlow] = (int64)root_t[i] * pwlowc % p;
    std::fill(f, f + pwlow, 0);
  }
}
}  // namespace poly
using namespace poly;
poly_t f, g, rt, invrt;
int main() {
  polyinit();
  const int n = rd() + 1, k = rd() + 1, deg = 32768, deg2 = deg + deg;
  f[0] = 1;
  f[1] = 6;
  f[2] = 1;
  polysqrt(f, rt, deg);
  polyinv(rt, invrt, deg);
  g[0] = div2(rt[0] + 1);
  g[1] = div2(rt[1] + 1);
  for (int i = 2; i != deg; ++i) g[i] = div2(rt[i]);
  polypow(g, f, n, deg);
  DFT(f, deg2);
  DFT(invrt, deg2);
  for (int i = 0; i != deg2; ++i) f[i] = (int64)f[i] * invrt[i] % p;
  IDFT(f, deg2);
  const int lw = Min(n, k);
  for (int i = 1; i != lw; ++i) printf("%d ", f[i]);
  for (int i = lw; i != k; ++i) putchar('0'), putchar(' ');
  return 0;
}
