#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <functional>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <bitset>
#include <math.h>
#include <random>
#include <chrono>
using namespace std ;
using ll = long long ;
using ld = long double ;
template<class T> using V = vector<T> ;
template<class T> using VV = V<V<T>> ;
using pll = pair<ll,ll> ;
#define all(v) v.begin(),v.end()
ll mod = 998244353 ;
long double pie = acos(-1) ;
ll INF = 1000000000000 ;

void yorn(bool a){if(a) cout << "Yes" << endl ; else cout << "No" << endl ;}
//void YorN(bool a){if(a) cout << "YES" << endl ; else cout << "NO" << endl ;}
ll gcd(long long a,long long b){if(b==0) return a ; return gcd(b,a%b) ;}
ll lcm(long long a,long long b){return a/gcd(a,b)*b ;}
void fix_cout(){cout << fixed << setprecision(20) ;}
template<class T> void chmax(T &a,T &b){if(a<b) a = b ;}
template<class T> void chmin(T &a,T &b){if(a>b) a = b ;}

int main(){
  int n,k ;
  cin >> n >> k ;
  if(n<k){
    cout << 0 << endl ;
    return 0 ;
  }
  VV<ll> dp(n+1,V<ll>(2*n+1,0)) ;  
  dp[0][0] = 1 ; 
  for(int i=1;i<=n;i++){
    for(int j=i*2;j>=0;j--){
      ll sub = 0 ;
      if(j*2<=2*n) sub += dp[i][j*2] ;
      if(j>=2) sub += dp[i-1][j-2] ;
      dp[i][j] = sub%mod ;
    }
  }
  ll ans = dp[n][k] ;
  if(k>=2) ans = (ans-dp[n-1][k-2]+mod)%mod ;
  cout << ans << endl ;
}
#include "bits/stdc++.h"
using namespace std;
void solution() {
  int n, k;
  cin >> n >> k;
  vector<vector<int>> f(n + 1, vector<int> (n + 1, -1));
  auto dp = [&](auto &&self, int N, int K) -> int {
    if (K == 0) return N == 0;
    if (N <= K) return N == K;
    if (f[N][K] != -1) return f[N][K];
    return f[N][K] = (self(self, N - 1, K - 1) + self(self, N, K * 2)) % 998244353;
  };
  cout << dp(dp, n, k); 
}
signed main() {
  ios_base::sync_with_stdio(0); cin.tie(0); int tc = 1;
#ifdef DEBUG
  freopen("input.txt", "r", stdin); 
#endif
  // cin >> tc; 
  while (tc --) { solution(); cout << "\n"; }
}