#include <bits/stdc++.h>
#include <atcoder/all> // AtCoder
using namespace std;
using namespace atcoder; // AtCoder
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using mint = modint998244353; // AtCoder
using vll = vector<long long>;
using vvll = vector<vector<long long>>;
using vvvll = vector<vector<vector<long long>>>;
using vvvvll = vector<vector<vector<vector<long long>>>>;
using dll = deque<long long>;
using ddll = deque<deque<long long>>;
using dddll = deque<deque<deque<long long>>>;
using ddddll = deque<deque<deque<deque<long long>>>>;
using pll = pair<long long, long long>;
using vpll = vector<pair<long long, long long>>;
using vvpll = vector<vector<pair<long long, long long>>>;
#define rep(i, n) for (long long i = 0; i < n; i++)
#define reps(i, n) for (long long i = 1; i <= n; i++)
#define rrep(i, n) for (long long i = n - 1; i >= 0; i--)
#define rreps(i, n) for (long long i = n; i >= 1; i--)
#define reep(i, a, b) for (long long i = a; i < b; i++)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define PI acos(-1.0)
#define YES printf("Yes\n"), exit(0)
#define NO printf("No\n"), exit(0)
constexpr long long MOD = 998244353LL;
constexpr long long INF = (1LL << 60);
template<class T> void setcout(T n) {cout << setprecision(n) << fixed;}
template<class T> void arrcout(T &a) { for(size_t i = 0; i < a.size(); i++) cout << (i ? " " : "") << a.at(i); cout << endl; }
template<class T> void arrcout2(T &a) { for(size_t i = 0; i < a.size(); i++) { for(size_t j = 0; j < a[i].size(); j++) cout << (j ? " " : "") << a.at(i).at(j); cout << endl;} }
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")

int main() {
	ll n, m; cin >> n >> m;
	vll a(n);
	rep(i, n) a[i] = m / n;
	rep(i, m % n) a[n - 1 - i]++;
	if(a.front() == a.back()) {
		mint ans = 1;
		mint p = 1;
		reps(i, a.front()) p *= i;
		rep(i, n) {
			mint cur = 1;
			for(ll j = m - i * a.front(); j > m - (i + 1) * a.front(); j--) cur *= j;
			ans *= cur / p;
		}
		cout << ans.val() << endl;
	}else{
		mint ans = 1;
		ll a1 = a.front(), a2 = a.back();
		mint p1 = 1; reps(i, a1) p1 *= i;
		mint p2 = 1; reps(i, a2) p2 *= i;
		ll r = m;
		rep(i, n) {
			mint cur = 1;
			rep(j, (i < m % n ? a2 : a1)) cur *= r, r--;
			ans *= cur / (i < m % n ? p2 : p1);
		}
		cout << ans.val() << endl;
	}
}