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 JAVA):

Solution:
import java.io.IOException;
import java.util.Arrays;

public class Test {

    final int K = 1 << 15;
    final int M = 998244353;
    final int g = 3;
    int n, k, k2;
    int[][] f = new int[5][K * 2 + 1];
    int idx = 1;

    long pmod(int b, int e) {
        int i = 1 << 31;
        long r = 1;
        while (i != 0) {
            r = (r * r) % M;
            if ((e & i) != 0) r = (r * b) % M;
            i >>>= 1;
        }
        return r;
    }

    void fft(int[] a, int len) {
        for (int i = 0; i < len; i++) {
            int j = i, x = 0, y = len - 1;
            while (y > 0) {
                x = (x << 1) + (j & 1);
                j >>>= 1;
                y >>>= 1;
            }
            if (i < x) {
                int t = a[i];
                a[i] = a[x];
                a[x] = t;
            }
        }
        for (int i = 1; i < len; i *= 2) {
            long s = pmod(g, (M - 1) / 2 / i);
            for (int j = 0; j < len; j += 2 * i) {
                long w = 1;
                for (int k = 0; k < i; k++) {
                    int u = a[j + k], v = (int)((a[j + k + i] * w) % M);
                    a[j + k] = (u + v) % M;
                    a[j + k + i] = (u - v + M) % M;
                    w = (w * s) % M;
                }
            }
        }
    }

    void ifft(int[] a, int len) {
        int ll = 1, rr = len - 1;
        while (ll < rr) {
            int t = a[ll];
            a[ll++] = a[rr];
            a[rr--] = t;
        }
        fft(a, len);
        long inv = pmod(len, M - 2);
        for (int i = 0; i < len; i++) a[i] = (int)((inv * a[i]) % M);
    }

    void mul(int[] a, int[] b, int[] c, int len) {
        for (int i = 0; i < len; i++) c[i] = (int)((a[i] * (long)b[i]) % M);
    }

    int readInt() {
        int ans = 0;
        try {
            boolean start = false;
            for (int c = 0; (c = System.in.read()) != -1; ) {
                if (c >= '0' && c <= '9') {
                    start = true;
                    ans = ans * 10 + c - '0';
                } else if (start) break;
            }
        } catch (IOException e) {
        }
        return ans;
    }

    void find(int n) {
        if (n == 1) {
            f[0][0] = 1;
            f[0][1] = 0;
            f[1][0] = 1;
            f[1][1] = 1;
            return;
        }
        if (n == 2) {
            f[0][0] = 1;
            f[0][1] = 1;
            f[0][2] = 0;
            f[1][0] = 1;
            f[1][1] = 3;
            f[1][2] = 1;
            return;
        }
        if (n % 2 == 1) {
            find(n - 1);
            int nidx = (idx + 1) % 3, pidx = (idx + 3 - 1) % 3;
            f[nidx][0] = 1;
            for (int i = 1; i < k2; i++) {
                f[nidx][i] = (f[idx][i] + f[idx][i - 1]) % M;
                f[nidx][i] = (f[nidx][i] + f[pidx][i - 1]) % M;
            }
            idx = nidx;
            return;
        }
        find(n / 2);
        int nidx = (idx + 1) % 3, pidx = (idx + 3 - 1) % 3;
        for (int i = 0; i < k2 - 1; i++) {
            f[3][i] = (f[idx][i + 1] - f[pidx][i + 1] + M) % M;
            f[3][i] = (f[3][i] - f[pidx][i] + M) % M;
        }
        Arrays.fill(f[idx], k2, k2 + k2, 0);
        Arrays.fill(f[pidx], k2, k2 + k2, 0);
        Arrays.fill(f[3], k2 - 1, k2 + k2, 0);

        fft(f[idx], k2 + k2);
        fft(f[pidx], k2 + k2);
        fft(f[3], k2 + k2);

        mul(f[idx], f[idx], f[nidx], k2 + k2);
        ifft(f[nidx], k2 + k2);
        mul(f[pidx], f[pidx], f[4], k2 + k2);
        ifft(f[4], k2 + k2);
        for (int i = 1; i < k2; i++) f[nidx][i] = (f[nidx][i] + f[4][i - 1]) % M;

        mul(f[idx], f[pidx], f[idx], k2 + k2);
        ifft(f[idx], k2 + k2);
        mul(f[pidx], f[3], f[4], k2 + k2);
        ifft(f[4], k2 + k2);
        for (int i = 1; i < k2; i++) f[idx][i] = (f[idx][i] + f[4][i - 1]) % M;
        idx = nidx;
    }

    void start() {
        n = readInt();
        k = readInt();
        k2 = 2;
        while (k2 <= k) k2 *= 2;
        find(n);
        int mk = Math.min(n, k);
        for (int i = 1; i <= mk; i++) System.out.print(f[idx][i] + " ");
        for (int i = mk + 1; i <= k; i++) System.out.print(0 + " ");
    }

    public static void main(String[] args) {
        Test t = new Test();
        t.start();
    }

}