#include <bits/stdc++.h>
#define pii pair<int, int>
#define fi first
#define se second
#define MP make_pair
#define ep emplace
#define eb emplace_back
#define int long long
#define rep(i, j, k) for (int i = j; i <= k; i++)
#define per(i, j, k) for (int i = j; i >= k; i--)
typedef double db;
typedef long double ldb;
typedef long long ll;
typedef __int128 lll;
typedef unsigned long long ull;
typedef unsigned int ui;
using namespace std;

int read() {
	int s = 0, f = 1;
	char c = getchar();
	while (c < '0' || c > '9') f ^= (c == '-'), c = getchar();
	while (c >= '0' && c <= '9') s = s * 10 + c - '0', c = getchar();
	return f ? s : -s;
}
const int mod = 998244353;
int fpow(int x, int k = mod - 2) {
	int res = 1;
	for (; k; k >>= 1) {
		if (k & 1) res = res * x % mod;
		x = x * x % mod;
	}
	return res;
}
int n, m, fac[20000005], ifac[20000005], f[20000005], ans;
int C(int x, int y) { return fac[x] * ifac[y] % mod * ifac[x - y] % mod; }

signed main() {
	fac[0] = 1;
	rep(i, 1, 20000000) fac[i] = fac[i - 1] * i % mod;
	ifac[20000000] = fpow(fac[20000000]);
	per(i, 20000000, 1) ifac[i - 1] = ifac[i] * i % mod;
	n = read(), m = read() - 1;
	for (int k = 0; ; k++) {
		int t1 = k * (3 * k - 1) / 2;
		int t2 = k * (3 * k + 1) / 2;
		int o = (k & 1) ? mod - 1 : 1;
		if (t1 <= m) f[t1] += o;
		if (t2 <= m && k != 0) f[t2] += o;
		if (t1 > m && t2 > m) break;
	}
	rep(i, 0, m) if (f[i]) ans = (ans + f[i] * C(n + m - i, n)) % mod;
	printf("%lld\n", ans * ifac[n] % mod);
	return 0;
}