#include <bits/stdc++.h>
#pragma GCC optimize(3, "Ofast", "inline")
using namespace std;
const long long maxn = 2e5 + 5;
const long long mod = 998244353;
const long long inf = 0x3f3f3f3f;
long long dp[505][505];
long long ans[maxn];
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  ;
  long long n, m;
  cin >> n >> m;
  for (long long i = 1; i <= n; ++i) {
    dp[i][0] = 1;
    for (long long j = 1; j <= n; ++j)
      for (long long k = 1; k <= min(i, j); ++k)
        dp[i][j] = (dp[i][j] + dp[i][j - k]) % mod;
  }
  for (long long i = 1; i <= n; ++i)
    ans[i] = (ans[i] + dp[i][n] - dp[i - 1][n] + mod) % mod;
  long long sum = 0;
  for (long long i = 1; i <= n; ++i)
    for (long long j = 1; j <= n; ++j)
      if (i * j < m) sum = (sum + ans[i] * ans[j]) % mod;
  cout << sum * 2 % mod;
  return 0;
}
