#include <bits/stdc++.h>
using namespace std;
const long long int MAX_N = 1e5 + 10, inf = 1e16, mod = 998244353;
long long int dp[600][600] = {};
int32_t main() {
  long long int n, k;
  cin >> n >> k;
  dp[0][0] = 1;
  for (long long int i = 0; i <= n; i++) {
    for (long long int j = 1; j <= n; j++) {
      if (j > i) {
        dp[i][j] = dp[i][i];
        continue;
      }
      for (long long int z = 1; z <= j; z++) {
        dp[i][j] += dp[i - z][j];
        dp[i][j] %= mod;
      }
    }
  }
  long long int ans = 0;
  for (long long int i = 1; i <= n; i++) {
    for (long long int j = 1; j <= n; j++) {
      if (i * j < k) {
        ans += (2 * (dp[n][i] - dp[n][i - 1] + mod) *
                (dp[n][j] - dp[n][j - 1] + mod)) %
               mod;
        ans %= mod;
      }
    }
  }
  cout << ans;
  return 0;
}
