#include<cstdio>

 #include<cstring>

 #include<string>

 #include<cmath>

 #include<iostream>

 #include<algorithm>

 #include<map>

 #include<set>

 #include<queue>

 #include<vector>

 #include<bitset>

 using namespace std;

 typedef long long ll;

 typedef unsigned int uint;

 typedef unsigned long long ull;

 typedef pair<int,int> PII;

 typedef vector<int> VI;

 #define fi first

 #define se second

 #define MP make_pair

 #define N      510

 #define M      51

 #define MOD 998244353

 #define eps 1e-8

 #define pi     acos(-1)

 #define oo     1e9

 int dp[N][N],f[N];

 void add(int &x,int y)

 {

     x=(ll)x+y;

     if(x>=MOD) x-=MOD;

 }

 int main()

 {

     int n,K;

     scanf("%d%d",&n,&K);

     for(int i=;i<=n;i++)

     {

         dp[][i]=;

         for(int j=;j<=n;j++)

          for(int k=;k<=min(i,j);k++) add(dp[j][i],dp[j-k][i]);

     }

     for(int i=;i<=n;i++) f[i]=(dp[n][i]-dp[n][i-]+MOD)%MOD;

     int ans=;

     for(int i=;i<=n;i++)

      for(int j=;j<=n;j++)

       if(i*j<K) add(ans,(ll)f[i]*f[j]%MOD);

     ans=ans*%MOD;

     printf("%d\n",ans);

     return ;

 }