#include <bits/stdc++.h>
using namespace std;
#include<atcoder/all>
using namespace atcoder;
using ll = long long;
const ll mod=998244353;

using mint=modint998244353;

using vm = vector<mint>;
using vvm = vector<vm>;
using vvvm = vector<vvm>;


vector<mint> fact, factinv, inv, factK;
void prenCkModp(ll n) {
    // factK.resize(4*n+5);
    fact.resize(n + 5);
    factinv.resize(n + 5);
    inv.resize(n + 5);
    fact[0] = fact[1] = 1;
    factinv[0] = factinv[1] = 1;
    inv[1] = 1;
    for (ll i = 2; i < n + 5; i++) {
        fact[i] = (fact[i - 1] * i);
        inv[i] = (mod - ((inv[mod % i] * (mod / i))));
        factinv[i] = (factinv[i - 1] * inv[i]);
    }
}
mint nCk(ll n, ll k) {
    if (n < k || k < 0) return 0;
    return (fact[n] * ((factinv[k] * factinv[n - k])));
}

vm ad(vm A,vm B){
    ll AN=A.size();
    ll BN=B.size();
    if(AN>BN){
        swap(A,B);
        swap(AN,BN);
    }
    vm C(BN,0);
    for(ll i=0;i<BN;i++){
        C[i]+=B[i];
        if(i<AN)C[i]+=A[i];
    }
    return C;
}

int main() {
    
    ll N,M;
    cin>>N>>M;
    vm V={0,1},U={1};
    for(int i=0;i<N;i++){
        vm NU=convolution(U,U);
        vm NV=convolution(V,ad(U,V));
        swap(U,NU);
        swap(V,NV);
        if(U.size()>M+5)U.resize(M+5);
        if(V.size()>M+5)V.resize(M+5);
    }
    vm an=ad(U,V);
    // for(int i=0;i<an.size();i++){
    //     cout<<i<<" "<<an[i].val()<<endl;
    // }
    if(an.size()<M+2){
        cout<<0<<endl;
        return 0;
    }
    cout<<an[M+1].val()<<endl;

}