#include <bits/stdc++.h>
using namespace std;
int n, k;
long long dp[510][510], qtd[510], mod = (998244353LL), ans;
long long solve(int i, int q) {
  if (i > n) return 1LL;
  if (dp[i][q] != -1) return dp[i][q];
  long long ans = 0;
  for (int j = 0; j + i <= n and j < q; j++)
    ans = (ans + solve(i + j + 1, q)) % mod;
  return dp[i][q] = ans;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> n >> k;
  memset(dp, -1, sizeof dp);
  for (int i = 1; i <= n; i++) {
    qtd[i] = (2 * solve(1, i) - 2 * solve(1, i - 1)) % mod;
    qtd[i] = (mod + qtd[i]) % mod;
  }
  memset(dp, -1, sizeof dp);
  for (int i = 1; i <= n; i++) {
    int d = (k % i == 0 ? k / i - 1 : k / i);
    if (d <= 0) continue;
    ans = (ans + solve(1, k / i) * qtd[i]) % mod;
  }
  cout << (mod + ans) % mod << "\n";
}
