#include <bits/stdc++.h>
using namespace std;
#include <atcoder/modint>
using mint = atcoder::modint998244353;

#define rep(i, l, r) for (int i = (int)(l); i<(int)(r); i++)
#define ll long long

struct Combination {
    vector<mint> fac, infac;
    Combination(int n) {
        fac.resize(n+1);
        infac.resize(n+1);
        fac[0] = 1;
        for (int i = 1; i <= n; i++) fac[i] = fac[i-1] * i;
        infac[n] = fac[n].inv();
        for (int i = n; i >= 1; i--) infac[i-1] = infac[i] * i;
    }
    mint operator()(int n, int k) {
        if (k < 0 || k > n) return 0;
        return fac[n] * infac[k] * infac[n-k];
    }
};

void solve() {
    int N, K; cin >> N >> K;
    if (N == 1) {
        cout << "1133311"[K] << endl;
        return;
    }
    Combination comb(2*N+4);
    mint ans = 0;
    ans += comb(2*N+4, K);
    //-反転
    if (K%2 == 0) {
        ans += comb(N+2, K/2);
    }
    //|反転1
    if (N%2 == 0 and K%2 == 0) {
        ans += comb(N+2, K/2);
    }
    if (N%2 == 1) {
        if (K%2 == 0) {
            //真ん中は0, 2
            if (K >= 0) {
                ans += comb(N+1, K/2);
            }
            if (K >= 2) {
                ans += comb(N+1, (K-2)/2);
            }
        }
        if (K%2 == 1) {
            //真ん中は1
            ans += comb(N+1, (K-1)/2) * 2;
        }
    }
    if (K%2 == 0) {
        ans += comb(N+2, K/2);
    }
    ans /= 4;
    cout << ans.val() << endl;
}

int main() {
    int T = 1;
    //cin >> T;
    while(T--) solve();
}