#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
int dp[505][505];
int mod = 998244353;
int main() {
  int n, K;
  scanf("%d %d", &n, &K);
  for (int i = 1; i <= n; i++) {
    dp[i][0] = 2;
    for (int j = 1; j <= n; j++) {
      for (int k = max(0, j - i); k < j; k++)
        dp[i][j] = (dp[i][j] + dp[i][k]) % mod;
    }
    for (int j = 1; j < i; j++) dp[i][n] -= dp[j][n];
  }
  long long ans = 0;
  for (int i = 1; i <= n; i++) {
    int ddp[505];
    memset(ddp, 0, sizeof(ddp));
    int need = (K + i - 1) / i;
    ddp[0] = dp[i][n];
    for (int j = 1; j <= n; j++) {
      for (int k = max(0, j - need + 1); k < j; k++) {
        ddp[j] = (ddp[j] + ddp[k]) % mod;
      }
    }
    ans += ddp[n];
    ans %= mod;
  }
  printf("%lld\n", ans);
}
