func_code_string: #include <bits/stdc++.h>   using namespace std;   const int mod = 998244353;   long long dp[511][511];   long long tol[511];   int main() {     int n, k, i, j, p;     scanf( %d%d , &n, &k);     for (i = 1; i <= n; ++i) dp[0][i] = 1;     for (i = 1; i <= n; ++i) {       for (j = 1; j <= n; ++j) {         for (p = max(i - j, 0); p <= i - 1; ++p) {           dp[i][j] = dp[i][j] + dp[p][j];           dp[i][j] %= mod;         }       }     }     for (i = 1; i <= n; ++i) {       tol[i] = dp[n][i] - dp[n][i - 1];     }     long long ans = 0;     for (i = 1; i <= n; ++i) {       for (j = 1; j <= n; ++j) {         if (i * j < k) {           ans += tol[i] * tol[j];           ans %= mod;         }       }     }     ans *= 2;     cout << (ans % mod + mod) % mod << endl;     return 0;   }   