#include <bits/stdc++.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
#endif
typedef long long  ll;
typedef pair<int,int> pii; typedef pair<ll,ll> pll;
const int INF = 1e9; const long long LINF = 1e18;
const int MOD = 998244353; const int MOD1 = 1e9+7;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(x) x.begin(), x.end()
template<typename T> bool chmin(T& a, T b){if(a > b){a = b; return true;} return false;}
template<typename T> bool chmax(T& a, T b){if(a < b){a = b; return true;} return false;}
void yorn(bool ans){cout << (ans?"Yes":"No") << endl; return;}

ll power(ll a, ll b, ll m){
    ll ans = 1, p = a;
    rep(i,50){
        ll wari = (1LL<<i);
        if((b/wari)%2==1) ans = ans*p%m;
        p = p*p%m;
    }
    return ans;
}

// しばらくはsize_tをキャストに任せてみようかな
int main(){
    ll n,m; cin >> n >> m;
    ll a = m/n;
    ll b = m%n; // a+1個
    ll c = n-b; // a個
    ll ans = 1;
    ll mm = m;
    // mmCa+1
    rep(k,b){
        rep(j,a+1){
            ans = ans*mm%MOD;
            mm--;
        }
        ll bumbo = 1;
        for(int i=1;i<=a+1;i++){
            bumbo = bumbo*i%MOD;
        }
        ans = ans*power(bumbo,MOD-2,MOD)%MOD;
    }
    if(a!=0){
        rep(i,c){
            rep(j,a){
                ans = ans*mm%MOD;
                mm--;
            }
            ll bumbo = 1;
            for(int k=1;k<=a;k++){
                bumbo = bumbo*k%MOD;
            }
            ans = ans*power(bumbo,MOD-2,MOD)%MOD;
        }
    }
    cout << ans << endl;

}