import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.BufferedWriter;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        OutputWriter out = new OutputWriter(outputStream);
        EStopOtherwise solver = new EStopOtherwise();
        solver.solve(1, in, out);
        out.close();
    }

    static class EStopOtherwise {
        public void solve(int testNumber, InputReader in, OutputWriter out) {
            int k = in.readInt();
            int n = in.readInt();

            Modulo.mod = MiscUtils.MODF;
            Modulo.buildCombination(5000);
            Modulo.buildPow(2, 2000);

            for (int i = 2; i <= 2 * k; i++) {
                Modulo ans = new Modulo(0);
                ans.add(calc(i, n, k));
                if (i % 2 == 0) ans.add(calc(i, n - 1, k));
                out.printLine(ans);
            }
        }

        private long calc(int i, int n, int k) {
            Modulo ret = new Modulo(0);
            int p = 0;
            for (int j = 1; j < i - j; j++) {
                if (i - j <= k) p++;
            }
            int l = k - 2 * p - (i % 2 == 0 ? 1 : 0);
            for (int q = 0; q <= Math.min(n, p); q++) {
                if (l == 0 && q == 0) continue;
                Modulo tmp = new Modulo(1);
                tmp.mlt(Modulo.c(p, q));
                tmp.mlt(Modulo.pow(2, q));
                tmp.mlt(Modulo.h(n - q, q + l));
                ret.add(tmp);
            }
            return ret.getValue();
        }

    }

    static class OutputWriter {
        private final PrintWriter writer;

        public OutputWriter(OutputStream outputStream) {
            writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
        }

        public OutputWriter(Writer writer) {
            this.writer = new PrintWriter(writer);
        }

        public void print(Object... objects) {
            for (int i = 0; i < objects.length; i++) {
                if (i != 0) {
                    writer.print(' ');
                }
                writer.print(objects[i]);
            }
        }

        public void printLine(Object... objects) {
            print(objects);
            writer.println();
        }

        public void close() {
            writer.close();
        }

    }

    static class Modulo {
        public static long mod;
        private long value;
        public static long[] nors;
        public static long[] revs;
        public static long[] pows = new long[0];
        private static long base = -1;

        public Modulo(long value) {
            this.value = value;
        }

        public static long add(long a, long b) {
            return ((a + b) % mod + mod) % mod;
        }

        public static long mlt(long a, long b) {
            return (a * b) % mod;
        }

        public static long rev(long a) {
            //return pow(a, mod - 2);
            return (Euclid.extgcd(a, mod, new long[3])[0] % mod + mod) % mod;
        }

        public static long pow(long a, long x) {
            if (base == a && x < pows.length) return pows[(int) x];
            long ans = 1 % mod;
            while (x > 0) {
                if ((x & 1) != 0) ans = (ans * a) % mod;
                x >>= 1;
                a = (a * a) % mod;
            }
            return ans;
        }

        public static void buildPow(long a, int n) {
            base = a;
            pows = new long[n + 1];
            pows[0] = 1;
            for (int i = 1; i <= n; i++) {
                pows[i] = mlt(pows[i - 1], base);
            }
        }

        public Modulo add(long a) {
            setValue(add(value, a));
            return this;
        }

        public Modulo add(Modulo m) {
            setValue(add(value, m.getValue()));
            return this;
        }

        public Modulo mlt(long a) {
            setValue(mlt(value, a));
            return this;
        }

        public static void buildCombination(int n) {
            nors = new long[n + 1];
            revs = new long[n + 1];

            nors[0] = 1;
            for (int i = 1; i <= n; i++) {
                nors[i] = mlt(nors[i - 1], i);
            }

            revs[n] = rev(nors[n]);
            for (int i = n - 1; i >= 0; i--) {
                revs[i] = mlt(revs[i + 1], i + 1);
            }
        }

        public static long h(int n, int k) {
            return k <= 0 ? 1 : new Modulo(nors[n + k - 1]).mlt(revs[n]).mlt(revs[k - 1]).getValue();
        }

        public static long c(int n, int k) {
            return n - k < 0 ? 0 : new Modulo(nors[n]).mlt(revs[k]).mlt(revs[n - k]).getValue();
        }

        public long getValue() {
            return value;
        }

        public void setValue(long value) {
            this.value = value;
        }

        public String toString() {
            return "" + value;
        }

    }

    static class MiscUtils {
        public static final int MODF = 998244353;

    }

    static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;
        private InputReader.SpaceCharFilter filter;

        public InputReader(InputStream stream) {
            this.stream = stream;
        }

        public int read() {
            if (numChars == -1) {
                throw new InputMismatchException();
            }
            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }
                if (numChars <= 0) {
                    return -1;
                }
            }
            return buf[curChar++];
        }

        public int readInt() {
            int c = read();
            while (isSpaceChar(c)) {
                c = read();
            }
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            int res = 0;
            do {
                if (c < '0' || c > '9') {
                    throw new InputMismatchException();
                }
                res *= 10;
                res += c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        public boolean isSpaceChar(int c) {
            if (filter != null) {
                return filter.isSpaceChar(c);
            }
            return isWhitespace(c);
        }

        public static boolean isWhitespace(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

        public interface SpaceCharFilter {
            public boolean isSpaceChar(int ch);

        }

    }

    static class Euclid {
        public static long[] extgcd(long a, long b, long[] is) {
            if (a == 0) {
                is[0] = 0;
                is[1] = 1;
                is[2] = b;
            } else {
                extgcd(b % a, a, is);
                long x = is[1] - b / a * is[0];
                is[1] = is[0];
                is[0] = x;
            }
            return is;
        }

    }
}



Measured memory_bytes: 35748