#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
#include<unordered_map>

#define fi first
#define se second
#define mkp std::make_pair
using ll=long long;
using llu=unsigned long long;
using std::max;
using std::min;
template<class T> void cmax(T&a,T b){a=max(a,b);}
template<class T> void cmin(T&a,T b){a=min(a,b);}

const ll mod=998244353;

struct MAT{
    int a[3][3];
    MAT(){memset(a,0,sizeof a);}
};
MAT operator*(MAT a,MAT b){
    MAT c;
    for(int i=0;i<3;++i)
    for(int j=0;j<3;++j)
    for(int k=0;k<3;++k)
        c.a[i][j]=(c.a[i][j]+(ll)a.a[i][k]*b.a[k][j])%mod;
    return c;
}

namespace xm{
    void _(){
        int N,M;

        scanf("%d%d",&N,&M);

        MAT I,T;
        I.a[0][0]=I.a[1][1]=I.a[2][2]=1;
        T.a[0][1]=T.a[0][2]=T.a[1][0]=T.a[2][1]=1;
        for(int k=N;k;k>>=1,T=T*T) if(k&1) I=I*T;

        ll Z=((ll)I.a[0][0]+I.a[1][1]+I.a[2][2])%mod;
        std::unordered_map<int,ll> dp;
        auto f=[&](auto&&self,int x)->ll{
            if(x<=1) return x?Z:1;
            if(dp.count(x)) return dp[x];
            if(x&1) return dp[x]=Z*self(self,x/2)%mod;
            return dp[x]=(self(self,x/2)+self(self,x/2-1))%mod;
        };
        printf("%lld\n",f(f,M));
    }
}

int main(){
    xm::_();
    return 0;
}