#include <iostream>
#include <vector>
using namespace std;


template<int MOD> struct Fp {
    long long val;
    constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
        if (val < 0) v += MOD;
    }
    constexpr int getmod() { return MOD; }
    constexpr Fp operator - () const noexcept {
        return val ? MOD - val : 0;
    }
    constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; }
    constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; }
    constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; }
    constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; }
    constexpr Fp& operator += (const Fp& r) noexcept {
        val += r.val;
        if (val >= MOD) val -= MOD;
        return *this;
    }
    constexpr Fp& operator -= (const Fp& r) noexcept {
        val -= r.val;
        if (val < 0) val += MOD;
        return *this;
    }
    constexpr Fp& operator *= (const Fp& r) noexcept {
        val = val * r.val % MOD;
        return *this;
    }
    constexpr Fp& operator /= (const Fp& r) noexcept {
        long long a = r.val, b = MOD, u = 1, v = 0;
        while (b) {
            long long t = a / b;
            a -= t * b; swap(a, b);
            u -= t * v; swap(u, v);
        }
        val = val * u % MOD;
        if (val < 0) val += MOD;
        return *this;
    }
    constexpr bool operator == (const Fp& r) const noexcept {
        return this->val == r.val;
    }
    constexpr bool operator != (const Fp& r) const noexcept {
        return this->val != r.val;
    }
    friend constexpr ostream& operator << (ostream &os, const Fp<MOD>& x) noexcept {
        return os << x.val;
    }
    friend constexpr istream& operator >> (istream &is, Fp<MOD>& x) noexcept {
        return is >> x.val;
    }
    friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {
        if (n == 0) return 1;
        auto t = modpow(a, n / 2);
        t = t * t;
        if (n & 1) t = t * a;
        return t;
    }
};


const int MOD = 998244353;
const int MAX = 6100;
using mint = Fp<MOD>;


int main() {
    int N, K; cin >> N >> K;

    // 二項係数とその累積和
    vector<vector<mint> > com(MAX, vector<mint>(MAX, 0));
    vector<vector<mint> > scom(MAX, vector<mint>(MAX+1, 0));
    com[0][0] = 1;
    for (int i = 1; i < MAX; ++i) {
        com[i][0] = 1;
        for (int j = 1; j < MAX; ++j) com[i][j] = com[i-1][j-1] + com[i-1][j];
    }
    for (int i = 0; i < MAX; ++i) {
        for (int j = 0; j < MAX; ++j) {
            scom[i][j+1] = scom[i][j] + com[i][j];
        }
    }

    // 0
    mint res =  0;

    // 2 しかやらない場合
    for (int i = 0; i <= N; ++i) {
        if (K % 2 == 0 && i*2 >= K) continue;
        res += com[N][i];
    }
    //cout << res << endl;
    
    for (int i = 0; i*2+1 < K; ++i) {
        int L = (K-1) - (i*2+1);
        mint tmp1 = 0;
        for (int m = 0; m <= min(L, N - (i+1)); ++m) {
            tmp1 += scom[m][L-m] * com[N][m+i+1];

            //cout << i << "+, " << m << ": " << scom[m][L-m] << ", " << com[N][m+i+1] << endl;
        }
        mint tmp2 = 0;
        for (int m = 0; m <= min(L, N - (i+1)); ++m) {
            tmp2 += com[m][L-m] * (scom[N][min(N, i*2+1+m)+1] - scom[N][i+1+m]);

            //cout << i << "-, " << m << ": " << com[m][L-m] << ", " << (scom[N][N+1] - scom[N][i+1+m]) << endl;
        }
        res += tmp1 + tmp2;

        //cout << i << ": " << L << ", " << tmp1 << ", " << tmp2 << endl;
    }
    cout << res << endl;
}
    














Measured memory_bytes: 582144