#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i < (n); i++)
using namespace std;
using ll = long long;

ll mod = 998244353;
long long modpow(long long a, long long n, long long mod) {
    long long res = 1;
    while (n > 0) {
        if (n & 1) res = res * a % mod;
        a = a * a % mod;
        n >>= 1;
    }
    return res;
}

int main(){
    ios::sync_with_stdio(false);
    ll N,M; cin>>N>>M;

    // 正方形を何カ所作れるか
    ll sq = M/N;
    // cerr << "sq: " << sq << endl;

    ll ans=0;
    for(ll i=0; i<=sq; i++){
        ll ret=0;
        ll a = M - i*N;
        // cerr << "a: " << a << endl;
        ll x = modpow(a+1, i, mod);
        // cerr << "x: " << x << endl;
        ans += x;
        ans %= mod;
    }
    cout << ans << endl;

}