#include <bits/stdc++.h>
using namespace std;
int dp[2][507][507];
int ct[507], prefix[507];
int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  dp[0][0][0] = 1;
  for (int i = 0; i < n; i++) {
    memset(dp[(i & 1) ^ 1], 0x00, sizeof(dp[(i & 1) ^ 1]));
    for (int j = 0; j <= n; j++)
      for (int k = 0; k <= n; k++) {
        dp[(i & 1) ^ 1][j + 1][max(k, j + 1)] += dp[i & 1][j][k];
        dp[(i & 1) ^ 1][j + 1][max(k, j + 1)] %= 998244353;
        dp[(i & 1) ^ 1][1][max(k, 1)] += dp[i & 1][j][k];
        dp[(i & 1) ^ 1][1][max(k, 1)] %= 998244353;
      }
  }
  for (int i = 0; i <= n; i++)
    for (int j = 0; j <= n; j++) {
      ct[i] += dp[n & 1][j][i];
      ct[i] %= 998244353;
    }
  for (int i = 0; i <= n; i++) prefix[i + 1] = (prefix[i] + ct[i]) % 998244353;
  int ans = 0;
  for (int i = 1; i <= n; i++)
    ans = (ans + (ct[i] * (long long int)prefix[min(n, (m - 1) / i) + 1]) / 2) %
          998244353;
  printf("%d\n", ans);
}
