#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
using mint = modint998244353;
const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
struct PM {
	mint x, y;
	PM() :x(0), y(1) {}
	PM(int x, int y) :x(x), y(y) {}
	PM(mint x, mint y) :x(x), y(y) {}
	PM& operator+=(const PM& other) {
		mint nx = x * other.y + y * other.x;
		mint ny = y * other.y;
		(*this).x = nx;
		(*this).y = ny;
		return *this;
	}
	PM& operator+=(const mint& other) { return PM(*this) += PM(other, 1); }
	PM& operator-=(const PM& other) {
		mint nx = x * other.y - y * other.x;
		mint ny = y * other.y;
		(*this).x = nx;
		(*this).y = ny;
		return *this;
	}
	PM& operator-=(const mint& other) { return PM(*this) -= PM(other, 1); }
	PM& operator*=(const PM& other) {
		mint nx = x * other.x;
		mint ny = y * other.y;
		(*this).x = nx;
		(*this).y = ny;
		return *this;
	}
	PM& operator*=(const mint& other) { return PM(*this) *= PM(other, 1); }
	PM& operator/=(const PM& other) {
		mint nx = x * other.y;
		mint ny = y * other.x;
		(*this).x = nx;
		(*this).y = ny;
		return *this;
	}
	PM& operator/=(const mint& other) { return PM(*this) /= PM(other, 1); }
	PM operator+(const PM& other) const { return PM(*this) += other; }
	PM operator+(const mint& other) const { return PM(*this) += other; }
	PM operator-(const PM& other) const { return PM(*this) -= other; }
	PM operator-(const mint& other) const { return PM(*this) -= other; }
	PM operator*(const PM& other) const { return PM(*this) *= other; }
	PM operator*(const mint& other) const { return PM(*this) *= other; }
	PM operator/(const PM& other) const { return PM(*this) /= other; }
	PM operator/(const mint& other) const { return PM(*this) /= other; }
	void debug() { cout << x.val() << "/" << y.val() << endl; }
	mint get() { return x * (y.inv()); }
};
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int c, x; cin >> c >> x;

	if (0 == x) {
		mint ans = (mint)1 / (c + 1);
		cout << ans.val() << endl;
		return 0;
	}
	if (x <= c) {
		mint ans = (mint)(x) / (x + 1);
		cout << ans.val() << endl;
		return 0;
	}
	vector dp(x - c + 1, vector<PM>(x + 1));
	dp[0][0] = PM(1, 1);
	rep(i, x - c) {
		rep(j, x) {
			dp[i + 1][j + 0] += dp[i][j] * j * PM(1, c + i + 1);
			dp[i + 1][j + 1] += dp[i][j] * (c + i + 1 - j) *PM(1, c + i + 1);
		}
	}
	PM ans(0, 1);
	rep(i, x + 1) ans += dp[x - c][i] * (x - i) *PM(1, x - i + 1);
	//ans.debug();
	cout << ans.get().val() << endl;
	return 0;
}