#include <bits/stdc++.h>
using namespace std;
long long n, limit, i, j, k, ans, last, c;
long long aa[2][505][505];
long long sum[505][505];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> n >> limit;
  memset(aa, 0, sizeof aa);
  aa[0][0][0] = 1;
  for (i = 1; i <= n; i++) {
    c = i % 2;
    last = 1 - c;
    if (i > 1) aa[0][0][0] = 0;
    for (j = 1; j <= n; j++) {
      sum[i][j] = 0;
      for (k = 1; k <= n; k++) {
        if (k < j)
          aa[c][j][k] = aa[last][j][k - 1];
        else if (k == j)
          aa[c][j][k] =
              (aa[last][j][k - 1] + aa[last][j - 1][k - 1]) % 998244353;
        if (k == 1) aa[c][j][k] = (aa[c][j][k] + sum[i - 1][j]) % 998244353;
        sum[i][j] = (sum[i][j] + aa[c][j][k]) % 998244353;
      }
    }
  }
  ans = 0;
  for (i = 1; i <= n; i++) {
    for (j = 1; j <= (limit + (i - 1)) / i - 1; j++) {
      ans = (ans + sum[n][i] * sum[n][j]) % 998244353;
    }
  }
  ans = (ans + ans) % 998244353;
  cout << ans << "\n";
  return 0;
}
