#include <bits/stdc++.h>

// 1. dp
typedef long double ld;
#define int long long

#define gcd            __gcd
#define endl           "\n"
#define setbits(x)     __builtin_popcountll(x)
#define zrobits(x)     __builtin_ctzll(x)
#define mod            1000000007
#define mod2           998244353
#define maxe           *max_element
#define mine           *min_element
#define inf            1e18
#define pb             push_back
#define all(x)         x.begin(), x.end()
#define f              first
#define s              second
#define lb             lower_bound
#define ub             upper_bound
#define ins            insert
#define sz(x)          (int)(x).size()
#define mk             make_pair
#define deci(x, y)     fixed<<setprecision(y)<<x
#define w(t)           int t; cin>>t; while(t--)
#define nitin          ios_base::sync_with_stdio(false); cin.tie(nullptr)
#define PI             3.141592653589793238
using namespace std;
int dp[4000][4000];
int solve(int n,int k){
    if(k>n) return 0;
    if(n==0) return 1;
    if(k==0) return 0;
    if(dp[n][k]!=0)
        return dp[n][k];
    return dp[n][k]=(solve(n-1,k-1)+solve(n,2*k))%mod2;

}
void solve() {
    int n,k;
    cin>>n>>k;
    cout<<solve(n,k)<<endl;
}

int32_t main() {
    nitin;

    solve();
}

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
const double pi = acos(-1);
const double eps = 1e-8;
const ll mod = 1e9 + 7;
const ull base = 131;
const ull mod1 = 1e9 + 9;
const ull mod2 = 1610612741;


const int maxn = 3e3 + 10;
ll dp[maxn][maxn];
int n, k;
const ll m = 998244353;

int main()
{
    scanf("%d%d", &n, &k);
    fill(dp[0], dp[0]+maxn, 1);
    for (int i = 1; i <= n; ++i)
        for (int j = i; j >= 1; --j) {
            dp[i][j] = dp[i - 1][j - 1] % m;
            if (2*j <= i) dp[i][j] = (dp[i][j] + dp[i][j*2])%m;
        }
    printf("%lld\n", dp[n][k]);
    return 0;
}