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

using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
#define rep3(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define rep2(i, a, b) rep3(i, a, b, 1)
#define rep1(i, n) rep2(i, 0, n)
#define rep0(n) rep1(aaaaa, n)
#define ov4(a, b, c, d, name, ...) name
#define rep(...) ov4(__VA_ARGS__, rep3, rep2, rep1, rep0)(__VA_ARGS__)
#define per(i, a, b) for (ll i = (a) - 1; i >= (b); i--)
#define fore(e, v) for (auto&& e : v)
#define all(a) begin(a), end(a)
#define sz(a) (int)(size(a))
#define lb(v, x) (lower_bound(all(v), x) - begin(v))
#define eb emplace_back

template <typename T, typename S>
bool chmin(T& a, const S& b) {
  return a > b ? a = b, 1 : 0;
}
template <typename T, typename S>
bool chmax(T& a, const S& b) {
  return a < b ? a = b, 1 : 0;
}
const int INF = 1e9 + 100;
const ll INFL = 3e18 + 100;
#define i128 __int128_t
struct _ {
  _() { cin.tie(0)->sync_with_stdio(0), cout.tie(0); }
} __;
const int MOD=998244353;
struct mod_fac{
  vector <ll> fac,inv,invf;
  mod_fac (int n):
    fac(n),inv(n),invf(n){
    fac[0]=fac[1]=1;
    inv[0]=inv[1]=1;
    invf[0]=invf[1]=1;
    for(int i=2;i<n;i++){
      fac[i]=fac[i-1]*i%MOD;
      inv[i]=inv[MOD%i]*(MOD-MOD/i)%MOD;
      invf[i]=invf[i-1]*inv[i]%MOD;
    }
  }
  ll comb(int n,int r){
    return fac[n]*invf[r]%MOD*invf[n-r]%MOD;
  }
  ll perm(int n,int r){
    return fac[n]*invf[n-r]%MOD;
  }
};
ll modpow(ll a,ll n){
  long long ret=1%MOD,t=a%MOD;
  while(n>0){
    if(n&1)ret=ret*t%MOD;
    t=t*t%MOD;
    n/=2;
  }
  return ret;
}

void ch(ll &a,ll b){
  a=(a+b)%MOD;
}
int main(){
  int N,M;
  cin>>N>>M;
  mod_fac F(3'000'000);
  ll minv=modpow(F.comb(M+N,N)-N+MOD,MOD-2);
  ll ans=0;
  rep(i,1,M){
    if(i*N>M)break;
    ch(ans,F.comb(M-i*N+N,N));
  }
  ans=ans*minv%MOD;
  cout<<ans<<'\n';
}