#include <bits/stdc++.h>
using namespace std;
int main() {
  long long int i, j, n, k, ans[511][511] = {}, out = 0;
  cin >> n >> k;
  for (i = 0; i <= n; i++) {
    ans[i][1] = ans[0][i] = 1;
    ans[i][0] = 0;
  }
  for (i = 1; i <= n; i++) {
    for (j = 2; j <= i; j++)
      ans[i][j] =
          ((ans[i - 1][j] * 2) - ((i - j - 1 >= 0) ? ans[i - j - 1][j] : 0)) %
          998244353;
    for (; j <= n; j++) ans[i][j] = ans[i][j - 1];
  }
  for (i = 1; i <= min(n, k); i++)
    out =
        (out + (((ans[n][i] - ans[n][i - 1]) * ans[n][min(((k - 1) / i), n)]) %
                998244353)) %
        998244353;
  cout << (out * 2) % 998244353;
}
