#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;

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

const int MAX = 510000;
const int MOD = 998244353;

ll fac[MAX], finv[MAX], inv[MAX];

void init(){
  fac[0]=fac[1]=1;
  finv[0]=finv[1]=1;
  inv[1]=1;
  for(int i=2;i<MAX;i++){
    fac[i]=fac[i-1]*i%MOD;
    inv[i]=MOD-inv[MOD%i]*(MOD/i)%MOD;
    finv[i]=finv[i-1]*inv[i]%MOD;
  }
}

ll nCr(int n,int k){
  if(n<k) return 0;
  if(n<0 || k<0) return 0;
  return fac[n]*(finv[k]*finv[n-k]%MOD)%MOD;
}

int main() {
  ll n,m;
  cin>>n>>m;
  
  if(n==1 || n>m){
    cout<<1<<endl;
    return 0;
  }
  else if(n==m){
    cout<<2<<endl;
    return 0;
  }
  
  init();
  
  ll a=m/n,ans=0;
  for(int k=0;k<=a;k++){
    ans=(ans+nCr(m-n*k+k,k))%MOD;
  }
  cout<<ans<<endl;

  return 0;
}