import java.io.BufferedReader;
// import java.io.FileInputStream;
// import java.io.FileOutputStream;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.Arrays;
import java.util.ArrayList;
import java.util.PriorityQueue;
import java.util.Random;
import java.util.StringTokenizer;
import java.util.TreeMap;
import java.util.TreeSet;

import static java.lang.Math.abs;
import static java.lang.Math.max;
import static java.lang.Math.min;
import static java.lang.Math.round;
import static java.lang.Math.sqrt;
import static java.util.Arrays.copyOf;
import static java.util.Arrays.fill;
import static java.util.Arrays.sort;
import static java.util.Collections.reverse;
import static java.util.Collections.reverseOrder;
import static java.util.Collections.sort;
import static java.util.Comparator.comparing;
import static java.util.Comparator.comparingInt;
import static java.util.Comparator.comparingLong;

public class Main {
    FastScanner in;
    PrintWriter out;

    long mod = 998244353;

    private void solve() throws IOException {
        int n = in.nextInt(), k = in.nextInt() - 1, m = min(n, k);
        long[] cntLine = new long[m + 1];
        long[] cnt = new long[m];

        long sum, min;
        for (int curK = 1; curK <= m; curK++) {
            fill(cnt, 0);
            cnt[0] = 1;
            sum = 1;

            for (int curN = 2, pos = curK - 1; curN <= n; curN++, pos = (pos + curK - 1) % curK) {
                min = cnt[pos];
                cnt[pos] = sum;
                sum = (sum + sum + mod - min) % mod;
            }

            for (int i = 0; i < m; i++)
                cntLine[curK] = (cntLine[curK] + cnt[i]) % mod;
        }

        for (int i = m; i > 0; i--)
            cntLine[i] = (cntLine[i] + mod - cntLine[i - 1]) % mod;

        long ans = 0;
        for (int i = 1; i <= m; i++)
            for (int j = 1; j <= m; j++)
                if (i * j <= k)
                    ans = (ans + cntLine[i] * cntLine[j] % mod) % mod;
        out.println((ans * 2) % mod);
    }

    class FastScanner {
        StringTokenizer st;
        BufferedReader br;

        FastScanner(InputStream s) {
            br = new BufferedReader(new InputStreamReader(s));
        }

        String next() throws IOException {
            while (st == null || !st.hasMoreTokens())
                st = new StringTokenizer(br.readLine());
            return st.nextToken();
        }

        boolean hasNext() throws IOException {
            return br.ready() || (st != null && st.hasMoreTokens());
        }

        int nextInt() throws IOException {
            return Integer.parseInt(next());
        }

        long nextLong() throws IOException {
            return Long.parseLong(next());
        }

        double nextDouble() throws IOException {
            return Double.parseDouble(next());
        }

        String nextLine() throws IOException {
            return br.readLine();
        }

        boolean hasNextLine() throws IOException {
            return br.ready();
        }
    }

    private void run() throws IOException {
        in = new FastScanner(System.in); // new FastScanner(new FileInputStream(".in"));
        out = new PrintWriter(System.out); // new PrintWriter(new FileOutputStream(".out"));

        solve();

        out.flush();
        out.close();
    }

    public static void main(String[] args) throws IOException {
        new Main().run();
    }
}