#include <bits/stdc++.h>
using namespace std;
const long long int K = 998244353;
const long long int N = 505;
long long int d[N][N], g[N][N];
long long int S[N][N];
long long int T[N], T1[N];
int main() {
  ios::sync_with_stdio(0);
  cin.tie(NULL);
  int n, kk;
  cin >> n >> kk;
  d[1][1] = 1;
  S[1][1] = 1;
  for (int i = 2; i <= n; i++) {
    for (int m = 1; m <= i - 1; m++) {
      for (int k = 1; k <= m; k++) g[m][k] = d[m][k];
    }
    for (int m = 1; m <= i; m++) {
      for (int k = 1; k <= m; k++) {
        if (k == 1) {
          d[m][k] = S[m][i - 1];
        } else {
          if (m == k) {
            d[m][k] = (g[m - 1][k - 1] + g[m][k - 1]) % K;
          } else {
            d[m][k] = g[m][k - 1];
          }
        }
        S[m][i] = (S[m][i] + d[m][k]) % K;
      }
    }
  }
  for (int m = 1; m <= n; m++) {
    for (int k = 1; k <= m; k++) T[m] = (T[m] + d[m][k]) % K;
  }
  for (int i = 1; i <= n; i++) {
    T1[i] = (T1[i - 1] + T[i]) % K;
  }
  long long int res = 0;
  for (int i = 1; i <= min(kk - 1, n); i++) {
    res = (res + 2 * T[i] * T1[min((kk - 1) / i, n)] % K) % K;
  }
  cout << res << endl;
  return 0;
}
