#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 505;
const long long MOD = 998244353;
long long dp[MAX_N][2], dp_side[MAX_N];
int main() {
  int n, xk;
  cin >> n >> xk;
  for (int side = 1; side <= n; side++) {
    dp[0][0] = dp[0][1] = 1;
    for (int i = 1; i <= n; i++) dp[i][0] = dp[i][1] = 0;
    for (int i = 1; i <= n; i++)
      for (int j = 0; j < 2; j++)
        for (int k = i - 1; k >= 0; k--)
          if (i - k <= side) {
            dp[i][j] += dp[k][1 - j];
            if (dp[i][j] > MOD) dp[i][j] -= MOD;
          }
    dp_side[side] = dp[n][0];
    dp_side[side] += dp[n][1];
    if (dp_side[side] > MOD) dp_side[side] -= MOD;
  }
  long long ans = 0;
  for (int side = 1; side <= n; side++) {
    long long cnt_row = ((dp_side[side] - dp_side[side - 1]) % MOD + MOD) % MOD;
    for (int i = 0; i <= n; i++) dp[i][0] = dp[i][1] = 0;
    dp[0][0] = cnt_row;
    for (int i = 1; i <= n; i++)
      for (int j = 0; j < 2; j++)
        for (int k = i - 1; k >= 0; k--)
          if ((i - k) * side < xk) {
            dp[i][j] += dp[k][1 - j];
            if (dp[i][j] > MOD) dp[i][j] -= MOD;
          }
    ans += (dp[n][0] + dp[n][1]) % MOD;
    if (ans > MOD) ans -= MOD;
  }
  cout << (ans % MOD);
  return 0;
}
