#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;

#define rep(i,n) for(ll i=0;i<n;++i)
#define all(a) (a).begin(),(a).end()
ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }
ll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
template<class T> T div_floor(T a, T b) { return a / b - ((a ^ b) < 0 && a % b); }
template<class T> T div_ceil(T a, T b) { return a / b + ((a ^ b) > 0 && a % b); }
template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }
template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }

#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;

void solve() {
    ll N,K;
    cin>>N>>K;
    vector<mint> dp(K+1,0);
    dp[0]=1;
    rep(i,2*N){
        vector<mint> ndp(K+1,0);
        rep(j,K){
            ndp[j+1]+=dp[j];
            ndp[j]+=dp[j+1];
        }
        swap(dp,ndp);
    }
    mint ans1=dp[0];

    dp=vector<mint>(K+1,0);
    dp[0]=1;
    rep(i,2*N){
        vector<mint> ndp(K,0);
        rep(j,K-1){
            ndp[j+1]+=dp[j];
            ndp[j]+=dp[j+1];
        }
        swap(dp,ndp);
    }
    mint ans2=dp[0];
    mint ans=ans1-ans2;
    cout<<ans.val()<<endl;
    return;
}


int main() {
    ll T=1;
    while (T--){
        solve();
    }
    return 0;
}