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 namespace std;
const int MOD = 998244353;
const double PI = acos(-1);
const int N = 1 << 16, L = 15, MASK = (1 << L) - 1;
complex<double> w[N];
void FFTInit() {
  for (int i = 0; i < N; ++i) {
    w[i] = complex<double>(cos(2 * i * PI / N), sin(2 * i * PI / N));
  }
}
void FFT(complex<double> p[], int n) {
  for (int i = 1, j = 0; i < n - 1; ++i) {
    for (int s = n; j ^= s >>= 1, ~j & s;)
      ;
    if (i < j) {
      swap(p[i], p[j]);
    }
  }
  for (int d = 0; (1 << d) < n; ++d) {
    int m = 1 << d, m2 = m * 2, rm = n >> (d + 1);
    for (int i = 0; i < n; i += m2) {
      for (int j = 0; j < m; ++j) {
        complex<double> &p1 = p[i + j + m], &p2 = p[i + j];
        complex<double> t = w[rm * j] * p1;
        p1 = p2 - t;
        p2 = p2 + t;
      }
    }
  }
}
complex<double> A[N], B[N], C[N], D[N];
void mul(int a[N], int b[N], int c[N], int same = false) {
  for (int i = 0; i < N; ++i) {
    if (i < N / 2) {
      A[i] = complex<double>(a[i] >> L, a[i] & MASK);
      B[i] = complex<double>(b[i] >> L, b[i] & MASK);
    } else {
      A[i] = 0;
      B[i] = 0;
    }
  }
  FFT(A, N);
  if (!same)
    FFT(B, N);
  else {
    for (int i = 0; i < N; ++i) B[i] = A[i];
  }
  for (int i = 0; i < N; ++i) {
    int j = (N - i) % N;
    complex<double> da = (A[i] - conj(A[j])) * complex<double>(0, -0.5),
                    db = (A[i] + conj(A[j])) * complex<double>(0.5, 0),
                    dc = (B[i] - conj(B[j])) * complex<double>(0, -0.5),
                    dd = (B[i] + conj(B[j])) * complex<double>(0.5, 0);
    C[j] = da * dd + da * dc * complex<double>(0, 1);
    D[j] = db * dd + db * dc * complex<double>(0, 1);
  }
  FFT(C, N), FFT(D, N);
  for (int i = 0; i < N; ++i) {
    long long da = (long long)(C[i].imag() / N + 0.5) % MOD,
              db = (long long)(C[i].real() / N + 0.5) % MOD,
              dc = (long long)(D[i].imag() / N + 0.5) % MOD,
              dd = (long long)(D[i].real() / N + 0.5) % MOD;
    c[i] = ((dd << (L * 2)) + ((db + dc) << L) + da) % MOD;
  }
}
int n, m;
int ans[2][N];
int vec[2][2][N];
long long nc[2][N];
int tmp[N];
void update(int a[2][N], int b[2][N], int c[2][N], int same = 0) {
  memset(nc, 0, sizeof nc);
  mul(a[0], b[0], tmp, same);
  for (int i = 0; i < N; ++i) nc[0][i] += tmp[i];
  mul(a[1], b[1], tmp, same);
  for (int i = 0; i < N; ++i) {
    if (i + 1 < N) {
      nc[0][i + 1] += tmp[i];
      nc[1][i + 1] -= tmp[i];
    }
    nc[1][i] -= tmp[i];
  }
  mul(a[0], b[1], tmp);
  for (int i = 0; i < N; ++i) nc[1][i] += tmp[i];
  if (!same) mul(a[1], b[0], tmp);
  for (int i = 0; i < N; ++i) nc[1][i] += tmp[i];
  for (int i = 0; i < N; ++i) {
    c[0][i] = nc[0][i];
    while (c[0][i] < 0) c[0][i] += MOD;
    while (c[0][i] >= MOD) c[0][i] -= MOD;
    c[1][i] = nc[1][i];
    while (c[1][i] < 0) c[1][i] += MOD;
    while (c[1][i] >= MOD) c[1][i] -= MOD;
  }
}
void solve() {
  ios::sync_with_stdio(false);
  FFTInit();
  cin >> n >> m;
  int cur = 0;
  vec[cur][0][0] = vec[cur][0][1] = vec[cur][1][0] = 1;
  ans[0][0] = 1;
  for (int tm = n; tm; tm >>= 1) {
    if (tm & 1) {
      update(ans, vec[cur], ans);
    }
    update(vec[cur], vec[cur], vec[cur ^ 1], 1);
    cur ^= 1;
  }
  for (int i = 1; i <= m; ++i) {
    cout << ans[0][i] << ' ';
  }
  cout << endl;
}
int main() {
  solve();
  return 0;
}