#include <bits/stdc++.h>
using namespace std;
const int MOD = 998244353;
const long double PI = acos(long double(-1));
int norm(long long i) { return (i % MOD + MOD) % MOD; }
const int N = 502;
long long h[N][N];
long long he[N][N];
long long sumh[N][N];
int main() {
  if (1) {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
  }
  int n, k;
  cin >> n >> k;
  for (int i = 0; i <= 1; ++i) {
    for (int j = 1; j <= n; ++j) {
      h[i][j] = 1;
      he[i][j] = h[i][j] - h[i][j - 1];
      sumh[i + 1][j] = sumh[i][j] + h[i][j];
    }
  }
  for (int i = 2; i <= n; ++i) {
    for (int j = 1; j <= i; ++j) {
      h[i][j] = norm(sumh[i][j] - sumh[i - j][j]);
      he[i][j] = norm(h[i][j] - h[i][j - 1]);
      sumh[i + 1][j] = norm(sumh[i][j] + h[i][j]);
    }
    for (int j = i + 1; j <= n; ++j) {
      sumh[i + 1][j] = sumh[i][j];
    }
  }
  int ans = 0;
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= n; ++j) {
      if (i * j < k) {
        ans = norm(ans + he[n][i] * he[n][j]);
      }
    }
  }
  cout << norm(long long(ans) * 2) << endl;
  return 0;
}
