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