import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;

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

    static class EInverseColoring {
        final long MOD = 998244353;

        private void getSumTill(long[] ar, long[] res) {
            long tillNow = 0;
            for (int i = 0; i < ar.length; i++) {
                tillNow += ar[i];
                if (tillNow >= MOD) {
                    tillNow -= MOD;
                }
                res[i] = tillNow;
            }
        }

        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int n = in.NextInt();
            int k = in.NextInt();
            long res = 0;
            long[][] exact = new long[n + 1][n + 1];
            exact[0][0] = 1;
            long[][] lessOrEqualTo = new long[n + 1][n + 1];
            getSumTill(exact[0], lessOrEqualTo[0]);
            for (int i = 1; i <= n; i++) {
                for (int j = 1; j <= i; j++) {
                    exact[i][j] += lessOrEqualTo[i - j][j];
                    if (exact[i][j] >= MOD)
                        exact[i][j] -= MOD;
                    for (int l = j + 1; l <= i - j; l++) {
                        exact[i][l] += exact[i - j][l];
                        if (exact[i][l] >= MOD)
                            exact[i][l] -= MOD;
                    }
                }
                getSumTill(exact[i], lessOrEqualTo[i]);
            }

            for (int i = 1; i <= n; i++) {
                int j = k / i;
                while (i * j < k) j++;
                if (j == 0) continue;
                j = Math.min(n + 1, j);
                // exactly i and less then j;
                res += exact[n][i] * lessOrEqualTo[n][j - 1] % MOD;
                res %= MOD;
            }
            out.println(res * 2 % MOD);
        }

    }

    static class InputReader {
        BufferedReader reader;
        StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine(), " \t\n\r\f,");
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int NextInt() {
            return Integer.parseInt(next());
        }

    }
}

