#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;
const int N = 500;
int n, m;
int dp[N + 1][N + 1], Dp[N + 1][N + 1];
int main() {
  cin >> n >> m;
  int res = 0, ans = 0;
  for (int i = 1; i <= n; i++) {
    dp[i][0] = Dp[i][0] = 1;
    for (int j = 1; j <= n; j++) {
      (dp[i][j] +=
       (Dp[i][j - 1] - (j - i + 1 > 1 ? Dp[i][max(1, j - i + 1) - 2] : 0)) %
       mod) %= mod;
      Dp[i][j] = (Dp[i][j - 1] + dp[i][j]) % mod;
    }
  }
  for (int i = 1; i <= n; i++) {
    (ans += 2ll * (dp[i][n] - dp[i - 1][n]) *
            dp[min(n, (m + i - 1) / i - 1)][n] % mod) %= mod;
  }
  cout << (ans + mod) % mod;
  return 0;
}
