#include <bits/stdc++.h>
 
#define f(i,a,b) for( ll i = a; i < b ; i++ )
#define af(i,a,b) for( ll i = a; i >= b ; i--)
#define rep(i,a,b,k) for(ll i = a; i < b ; i+= k )
#define arep(i,a,b,k) for( ll i = a; i >= b ; i-= k)
#define ones(x) (ll) __builtin_popcount(x)
#define fs first
#define sc second
#define pb push_back
#define po pop_back
#define mp make_pair 
#define sz(a) (ll) a.size()
#define all(a) a.begin(), a.end()
#define sor(a) sort( a.begin(), a.end() )
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL)
#define ller ios::sync_with_stdio(false);cin.tsie(nullptr);cout.tie(nullptr)
#define watch(x) cout << (#x) << " is " << (x) <<"\n"
#define test ll t;cin>>t;while(t--)
#define PI 3.1415926535
using namespace std;
typedef long long ll;
typedef long double ld; 
typedef pair<ll,ll> ii ;
typedef vector<ll>  vi ;
typedef vector<ii> vii ;
const ll mod = 998244353;
const ll MAX = 3e3+120;
const ll inf = 1e9;

ll dp[MAX][2*MAX];

ll DP(ll n,ll k){
    if(n<k) return 0;
    if(k==0){
        if(!n) return 1;
        return 0;
    }
    if(dp[n][k]) return dp[n][k];
    ll ans = DP(n-1,k-1) + DP(n,2*k);
    ans%=mod;
    return dp[n][k] = ans;
}

int main(){
    fastio;
    ll n,k;
    cin>>n>>k;
    cout<<DP(n,k)<<"\n";
    return 0;
}
#include <cstdio>
#include <cstring>
#include <algorithm>
#define cs const
#define il inline
#define max_n 3000
#define mod 998244353
using namespace std;
typedef long long ll;
typedef cs int& ci;
int dp[max_n+1][max_n<<1|1];
int main(){
	int n,k;
	scanf("%d%d",&n,&k);
	memset(dp,0,sizeof(dp));
	dp[0][0]=1;
	for(int i=1; i<=n; ++i)
		for(int j=i; j; /*printf("dp[%d][%d]:%d\n",i,j,dp[i][j]),*/--j)
			(dp[i][j]=dp[i-1][j-1]+dp[i][j<<1])>=mod&&(dp[i][j]-=mod);
	printf("%d\n",dp[n][k]);
	return 0;
}