#include <bits/stdc++.h>
#define pb push_back
#define INF 1<<30
#define all(x) x.begin(),x.end()
#define ms(a,v) memset(a,v,sizeof a)
#define II ({int a; scanf("%d", &a); a;})
#define LL  ({ll  a; scanf("%lld", &a); a;})
#define EPS 1e-10
#define pi acos(0.0)
#define endl '\n'
using namespace std;
typedef long long ll;
typedef vector<int> vi ;
typedef vector<ll> vl;

#define FOR(i,n) for( __typeof(n)i = 0 ; i < n ; i++)
#define FORL(i,a, b) for( __typeof(a)i = a ; i <= b ; i++)
#define FORR(i,a, b) for( __typeof(a)i = a ; i >= b ; i--)
#define For(i,n) for( __typeof(n)i = 1 ; i <= n ; i++)
#define forstl(i,n) for(__typeof(n.begin())i = n.begin();i!=n.end();i++)
#define forab(i,a,b) for( __typeof(b) i = a ; i <= (b) ; i++ )
#define forba(i,b,a) for( __typeof(b) i = b ; i >= (a) ; i-- )
#define sz(v)               ((int)((v).size()))
const ll OO = 1e8;


int x[4] = {0 , 0 , -1, 1};
int y[4] = {1, -1, 0  , 0};

ll dp[3005][3005];

ll count(ll n , ll k)
{
    if (k < 0 || n < k) return 0LL;

    if (n <= 0 || k <= 0)
    {
        if (n == 0 && k == 0)
        {
            return 1LL;
        }
        return 0LL;
    }


    if (dp[n][k] >= 0)
        return dp[n][k];

    dp[n][k] = (count(n - 1, k - 1) + count(n , 2 * k) ) % 998244353LL;
    return (dp[n][k]);
}

void solve()
{
    ll n, k;
    cin >> n >> k;

    FOR(i, n + 3)
    {
        FOR(j, n + 3)
        {
            dp[i][j] = -1;
        }
    }
    cout << count(n, k) << endl;
}

int main()
{


    int T = 1;
    //cin >> T;
    // cin.ignore(); must be there when using getline(cin, s)

    //freopen("input.txt", "r", stdin);

    // Printing the Output to output.txt file
    //freopen("output.txt", "w", stdout);

    while (T--)
    {
        solve();
    }

    return 0;
}




#include <bits/stdc++.h>

#define int long long
#define double long double
#define ff first
#define ss second
#define endl '\n'
#define ii pair<int, int>
#define mp make_pair
#define mt make_tuple
#define DESYNC                      \
  ios_base::sync_with_stdio(false); \
  cin.tie(0);                       \
  cout.tie(0)
#define pb push_back
#define vi vector<int>
#define vii vector<ii>
#define all(x) x.begin(), x.end()
#define EPS 1e-9
#define INF 1e18
#define ROOT 1
#define curtime chrono::steady_clock::now().time_since_epoch().count
#define rep(i, beg, n, s) for (int i = beg; i < n; i += s)
using ll = long long;
using namespace std;
const double PI = acos(-1);
// const int M = 1000000007;
const int M = 998244353;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
inline int mod(int n, int m = M) {
  int ret = n % m;
  if (ret < 0) ret += m;
  return ret;
}

int exp(int n, int k, int m = M) {
  if (k == 0) return 1;
  if (k == 1) return n;
  int ax = exp(n, k / 2, m);
  ax = mod(ax * ax, m);
  if (k % 2) ax = mod(ax * n, m);
  return ax;
}

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

int dp[3123][3123];

//#define MULTIPLE_TEST_CASE
void solution() {
  int n, k;
  cin >> n >> k;
  memset(dp, 0, sizeof dp);
  dp[0][0] = 1;
  for (int i = 1; i <= n; i++) {
    for (int j = i; j >= 1; j--) {
      dp[i][j] = dp[i - 1][j - 1] + (2 * j <= n ? dp[i][2 * j] : 0);
      dp[i][j] = mod(dp[i][j]);
      // cout << "dp[" << i << "][" << j << "] = " << dp[i][j] << endl;
    }
  }
  cout << dp[n][k] << endl;
}

int32_t main() {
  DESYNC;
  int t = 1;
#ifdef MULTIPLE_TEST_CASE
  cin >> t;
#endif
  while (t--) solution();
}
