#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;
void add(int &x, int y) {
  if ((x += y) >= mod) x -= mod;
}
int mul(int x, int y) { return 1LL * x * y % mod; }
int dp[505][505];
int main() {
  dp[0][0] = 1;
  int n, k;
  cin >> n >> k;
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= i; ++j)
      for (int k = 0; k <= i - j; ++k) add(dp[i][max(j, k)], dp[i - j][k]);
  int sol = 0;
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= n; ++j)
      if (i * j < k) add(sol, mul(dp[n][i], dp[n][j]));
  cout << mul(2, sol) << '\n';
}
