#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];
int solve(int n, int k) {
  if (!k) return 0;
  dp[0] = dp[1] = 2;
  for (int i = 2; i <= n; i++) {
    dp[i] = (2 * dp[i - 1]) % MOD;
    if (i >= k + 1) dp[i] = (dp[i] - dp[i - (k + 1)] + MOD) % MOD;
  }
  return dp[n];
}
int pre[maxn], cnt[maxn];
int init() {
  pre[0] = 0;
  for (int i = 1; i <= n; i++) pre[i] = solve(n, i);
  for (int i = 1; i <= n; i++) cnt[i] = (pre[i] - pre[i - 1] + MOD) % MOD;
  int ans = 0;
  for (int i = 1; i <= n; i++) {
    ans = (ans + (long long)cnt[i] * pre[min(n, (k - 1) / i)]) % MOD;
  }
  ans = ((long long)ans * (MOD + 1) / 2) % MOD;
  return ans;
}
int main() {
  while (cin >> n >> k) {
    int ans = init();
    cout << ans << endl;
  }
  return 0;
}
