Problem: 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.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using ll = long long;
const int C = 2001, F = 200, D = 1 << 16, M = 998244353;
ll dp[C][C], res[F][D];
int sols[F];
inline ll pow(ll a, ll b, ll M) {
  ll c = 1;
  while (b > 0) {
    if (b % 2 == 1) c = (c * a) % M;
    b /= 2;
    a = (a * a) % M;
  }
  return c;
}
void butterfly(int n, int dp[]) {
  int m = n / 2, i, curcon = 1, j;
  dp[0] = 0;
  for (j = 1; j < n;) {
    for (i = 0; i < curcon; i++, j++) dp[j] = dp[j - curcon] + m;
    curcon *= 2, m /= 2;
  }
}
ll _ntt_tmp[D];
int _ntt_dp[D];
void dft(ll poly[], int n, int ln, ll w[], ll M, ll res[]) {
  int i, d, cur, beg, tzar, md;
  ll nw;
  butterfly(n, _ntt_dp);
  for (i = 0; i < n; i++) {
    if (_ntt_dp[i] <= ln)
      res[i] = poly[_ntt_dp[i]];
    else
      res[i] = 0;
  }
  for (cur = 2, d = 1; cur <= n; cur *= 2, d++) {
    for (beg = 0; beg < n; beg += cur) {
      nw = 1;
      tzar = cur / 2;
      for (i = 0; i < cur; i++) {
        md = (i >= tzar ? i - tzar : i);
        _ntt_tmp[beg + i] = (res[beg + md] + nw * res[beg + tzar + md]) % M;
        nw = (nw * w[d]) % M;
      }
    }
    for (i = 0; i < n; i++) res[i] = _ntt_tmp[i];
  }
}
const int _NTT_D = 21;
ll res1[D], res2[D], full_mul[D], w[_NTT_D], iw[_NTT_D];
void ntt_full(ll a[], int n, ll b[], int m, ll M, ll finale[]) {
  int i = 1, mn = n + m, close = 0, p0 = 1;
  for (i = 1;; i <<= 1) {
    if ((i ^ mn) == 0) break;
    if ((i ^ mn) < mn) mn ^= i, close = 1;
    p0++;
  }
  if (close == 1) mn <<= 1, p0++;
  ll inn = pow(mn, M - 2, M);
  ll root = 3;
  ll w0 = pow(root, 17 * 7 * (1 << (23 - p0)), M);
  w[p0] = w0;
  iw[p0] = pow(w0, M - 2, M);
  for (i = p0 - 1; i >= 0; i--) w[i] = (w[i + 1] * w[i + 1]) % M;
  for (i = p0 - 1; i >= 0; i--) iw[i] = (iw[i + 1] * iw[i + 1]) % M;
  dft(a, mn, n, w, M, res1);
  dft(b, mn, m, w, M, res2);
  for (i = 0; i < mn; i++) full_mul[i] = (res1[i] * res2[i]) % M;
  dft(full_mul, mn, mn, iw, M, finale);
  for (i = 0; i < mn; i++) finale[i] = (finale[i] * inn) % M;
}
void copy(ll tab[], ll aim[], int ln) {
  for (int i = 0; i <= ln; i++) aim[i] = tab[i];
}
void mover(ll t2[], ll t1[], ll aim[], int ln) {
  aim[0] = t1[0];
  for (int j = 1; j <= ln; j++) {
    aim[j] = (t1[j] + t1[j - 1] + t2[j - 1]) % M;
  }
}
ll tmp[D];
void multipla(ll l1[], ll r1[], ll l2[], ll r2[], ll aim[], int size) {
  ntt_full(l1, size, r1, size, M, tmp);
  ntt_full(l2, size, r2, size, M, aim);
  for (int j = 1; j <= size; j++) aim[j] = (aim[j] + tmp[j - 1]) % M;
  for (int j = 0; j <= size * 2; j++) tmp[j] = 0;
}
int findo(int value, int x) {
  while (sols[x] != value) x++;
  return x;
}
int main() {
  int n, k, i, j, left, right, new_left, new_right;
  scanf("%d %d", &n, &k);
  dp[0][0] = 1;
  for (i = 1; i < C; i++) {
    for (j = 0; j < C; j++) {
      dp[i][j] = (dp[i][j] + dp[i - 1][j]) % M;
      if (j > 0) dp[i][j] = (dp[i][j] + dp[i - 1][j - 1]) % M;
      if (i > 1 && j > 0) dp[i][j] = (dp[i][j] + dp[i - 2][j - 1]) % M;
    }
  }
  left = n, right = n;
  sols[0] = n, j = 1;
  while (true) {
    new_left = left / 2 - 1;
    if (left != right || n % 2 == 1)
      new_right = left / 2 + 1;
    else
      new_right = new_left + 1;
    for (i = new_right; i >= new_left; i--) {
      sols[j] = i;
      j++;
    }
    left = new_left, right = new_right;
    if (sols[j - 1] + 1 < C) break;
  }
  int l1, l2, r1, r2, mm = j;
  for (i = j - 1; i >= 0; i--) {
    if (sols[i] < C)
      copy(dp[sols[i]], res[i], sols[i]);
    else if (sols[i + 2] + 2 == sols[i])
      mover(res[i + 2], res[i + 1], res[i],
            (((sols[i]) < (k)) ? (sols[i]) : (k)));
    else {
      l1 = findo(sols[i] / 2 - 1, i);
      r1 = findo(sols[i] / 2 - ((sols[i] % 2 == 0) ? 1 : 0), i);
      l2 = findo(sols[i] / 2, i);
      r2 = findo(sols[i] / 2 + sols[i] % 2, i);
      multipla(res[l1], res[r1], res[l2], res[r2], res[i],
               (((sols[i]) < (k)) ? (sols[i]) : (k)));
    }
  }
  for (i = 1; i <= k; i++) printf("%lld ", res[0][i]);
  printf("\n");
  return 0;
}