#include <bits/stdc++.h>
namespace IO{
    char buf[1000000],*p1,*p2;
    inline char getc(){
        if(p1==p2) p2=(p1=buf)+fread(buf,1,1000000,stdin);
        return p1==p2?EOF:*(p1++);
    }
    template<typename tp>inline void r(tp &n){
        n=0;char c=getc();
        while(!isdigit(c)) c=getc();
        while( isdigit(c)) n=n*10+c-48,c=getc();
    }
    template<typename tp,typename...Args>inline void r(tp &n,Args&...args){
        r(n);r(args...);
    }
    template<typename tp>inline void write(tp  n){
        if(n/10) write(n/10);
        putchar(n%10+48);
    }
   template<typename tp>inline void w(tp n,char c='\n'){
       write(n);putchar(c);
    }
};
using namespace IO;
const int N=3e3+5,Mod=998244353;
using namespace std;
int f[N][N];
int solve(int n,int k){
    if(n<=k) return n==k;
    if(k==0) return 0;
    if(f[n][k]!=-1) return f[n][k];
    return f[n][k]=(solve(n-1,k-1)+solve(n,2*k))%Mod;
}
int main(){

   // freopen("1.in","r",stdin);

    int n,k;r(n,k);
    memset(f,-1,sizeof f);
    w(solve(n,k));
    return 0;
}
#include "bits/stdc++.h"

#define MOD 998244353
#define rep(i, n) for(ll i=0; i < (n); i++)
#define rrep(i, n) for(ll i=(n)-1; i >=0; i--)
#define ALL(v) v.begin(),v.end()
#define rALL(v) v.rbegin(),v.rend()
#define FOR(i, j, k) for(ll i=j;i<k;i++)
#define debug_print(var) cerr << #var << "=" << var <<endl;
#define DUMP(i, v)for(ll i=0;i<v.size();i++)cerr<<v[i]<<" "
#define fi first
#define se second

using namespace std;
typedef long long int ll;
typedef vector<ll> llvec;
typedef vector<double> dvec;
typedef pair<ll, ll> P;
typedef long double ld;
struct edge{ll x, c;};

ll mod(ll a, ll mod){
  ll res = a%mod;
  if(res<0)res=res + mod;
  return res;
}

ll modpow(ll a, ll n, ll mod){
  ll res=1;
  while(n>0){
    if(n&1) res=res*a%mod;
    a=a*a%mod;
    n>>=1;
  }
  return res;
}

ll modinv(ll a, ll mod){
  ll b=mod, u=1, v=0;
  while(b){
    ll t=a/b;
    a-=t*b; swap(a, b);
    u-=t*v; swap(u, v);
  }
  u%=mod;
  if(u<0)u+=mod;
  return u;
}

ll gcd(ll a, ll b){
  ll r = a%b;
  if(r==0) return b;
  else return gcd(b, a%b);
}

bool is_prime(ll n){
  ll i = 2;
  if(n==1)return false;
  if(n==2)return true;
  bool res = true;
  while(i*i <n){
    if(n%i==0){
      res = false;
    }
    i = i+1;
  }

  //if(i==1)res = false;
  if(n%i==0)res=false;
  return res;
}

ll N, K;
vector<llvec> m;

ll f(ll n, ll k){
  //cerr <<  n << " " << k << " ";
  if(k<=0)return 0;
  if(n<=0 or k<=0 or n<k){
    m[n][k] = 0;
    return 0;
  }
  if(n==k)m[n][k]=1;
  if(m[n][k]>=0)return m[n][k];
  ll tmp=0;
  tmp = mod(f(n-1, k-1) + f(n, 2*k), MOD);
  //cerr << tmp << endl;
  m[n][k]=tmp;
  return tmp;
}

/**************************************
** A main function starts from here  **
***************************************/
int main(){
  cin >> N >> K;
  m = vector<llvec>(N+1, llvec(2*(N+1), -1));
  cout << f(N, K);
  return 0;
}
