#include <bits/stdc++.h>
using namespace std;
const long long inf = 9.2e18;
const int maxn = 5e2 + 70;
const int INF = 2.1e9;
const int maxm = 1e6 + 70;
const int MOD = 998244353;
const double eps = 1e-7;
const double PI = acos(-1.0);
int n, m, k;
int dp[maxn][maxn], dp2[2][maxn][maxn];
int solve(int n, int k) {
  dp[1][1] = 2;
  for (int j = 2; j < k; j++) dp[1][j] = 0;
  for (int i = 2; i <= n; i++) {
    dp[i][1] = 0;
    for (int j = 1; j < k; j++) dp[i][1] = (dp[i][1] + dp[i - 1][j]) % MOD;
    for (int j = 2; j < k; j++) dp[i][j] = dp[i - 1][j - 1];
  }
  int ans = 0;
  for (int j = 1; j < k; j++) ans = (ans + dp[n][j]) % MOD;
  return ans;
}
int init() {
  bool t = 0;
  for (int x = 1; x <= n; x++) dp2[t][x][1] = solve(n, x + 1);
  for (int x = n; x >= 1; x--)
    dp2[t][x][1] = (dp2[t][x][1] - dp2[t][x - 1][1] + MOD) % MOD;
  for (int i = 2; i <= n; i++) {
    for (int x = 1; x <= min(n, k - 1); x++) {
      dp2[t ^ 1][x][1] = 0;
      for (int j = 1; j <= i - 1; j++) {
        dp2[t ^ 1][x][1] = (dp2[t ^ 1][x][1] + dp2[t][x][j]) % MOD;
      }
      for (int y = 2; y <= min(i, (k - 1) / x); y++) {
        dp2[t ^ 1][x][y] = dp2[t][x][y - 1];
      }
    }
    t ^= 1;
  }
  int ans = 0;
  for (int x = 1; x <= min(n, k - 1); x++) {
    for (int y = 1; y <= min(n, (k - 1) / x); y++) {
      ans = (ans + dp2[t][x][y]) % MOD;
    }
  }
  return ans;
}
int main() {
  while (cin >> n >> k) {
    int ans = init();
    cout << ans << endl;
  }
  return 0;
}
