#include<bits/stdc++.h>
using namespace std;
#define ll long long
const ll maxn=200005;
const ll mod=998244353;
const int step=10000000;
ll s[]={1,682498929,491101308,76479948,723816384,67347853,27368307,625544428,199888908,888050723,927880474,281863274,661224977,623534362,970055531,261384175,195888993,66404266,547665832,109838563,933245637,724691727,368925948,268838846,136026497,112390913,135498044,217544623,415142154,891898782,405611912,736278115,229536514,480274336,638755259,468728166,882585520,359353385,811209584,514801903,732344570,954245986,206896911,213568759,252936166,554913437,838341237,951279549,94285628,496734645,263053397,863300896,78850688,961812918,502676128,683002622,70993658,57828060,540059376,966297356,862660721,505016590,928116398,404419904,807298370,82020297,713175231,906232257,511370068,944439304,712532408,68882006,418194288,884090782,867828185,558066378,909433461,847549272,240775911,957939114,834005124,821670351,123652893,735368502,525287739,764832288,900035302,630301779,680463,512718368,913214555,798062809,750369378,353595175,607850020,443834863,205506097,306514172,993950427,392117421};
ll qmksm(ll a,ll b){
    ll ans,i,j,k;
    ans=1;
    while(b){
        if(b&1) ans=ans*a%mod;
        a=a*a%mod;
        b>>=1;
    }
    return ans;
}
ll ny(ll n){
    ll i,j,k;
    return qmksm(n,mod-2);
}
ll gfac(ll n){
    ll ans,zc,i,j,k;
    if(n>=mod) return 0;
    if(n<0) return 0;
    k=n/step;
    ans=s[k];
    zc=k*step+1;
    for(i=zc;i<=n;i++){
        ans=ans*i%mod;
    }
    return ans;
}
ll cal(ll n,ll m){
    ll zc,zc1,zc2,i,j,k;
    if(m<0 or m>n) return 0;
    if(m==0 or m==n) return 1;
    zc=gfac(n);
    zc1=gfac(m);
    zc2=gfac(n-m);
    return zc*ny(zc1)%mod*ny(zc2)%mod;
}
ll luc(ll n,ll m){
    ll i,j,k;
    if(m==0) return 1;
    return luc(n/mod,m/mod)*cal(n%mod,m%mod)%mod;
}
int main(){
    ll n,m,ans,i,j,k;
    scanf("%lld%lld",&n,&m);
    ans=luc(n,m);
    printf("%lld\n",ans);
    return 0;
}