#include <bits/stdc++.h>
using namespace std;
template <class T>
T &get(T &n) {
  cin >> n;
  return n;
}
const int hell = 1000000007;
const long long INF = (long long)hell * hell;
const int MAXN = 500;
const int MAXK = MAXN * MAXN;
long long F[MAXN + 1][MAXN + 1];
long long G[MAXN + 1][MAXN + 1];
const int mod = 998244353;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int N, K, ans = 0;
  cin >> N >> K;
  for (int k = 1; k <= N; ++k) {
    G[k][1] = 1;
    G[k][0] = 1;
    for (int i = 2; i <= N; ++i) {
      for (int j = 1; j <= k && i - j >= 0; ++j)
        G[k][i] = (G[k][i] + G[k][i - j]) % mod;
    }
  }
  for (int k = 1; k <= N; ++k) {
    F[k][k] = 1;
    for (int i = k + 1; i <= N; ++i) {
      F[k][i] = G[k][i - k];
      for (int j = 1; j <= k - 1 && i - j >= 1; ++j)
        F[k][i] = (F[k][i] + F[k][i - j]) % mod;
    }
  }
  for (int k = 1; k <= N; ++k) {
    int X = min(N, K / k);
    if (k * X == K) --X;
    ;
    long long res = (F[k][N] * G[X][N]) % mod;
    res = (res * 2) % mod;
    ans = (ans + res) % mod;
  }
  cout << ans << "\n";
}
