#include <cstdio>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <vector>
#include <map>
#include <set>
#define LL long long
#define mr make_pair
#define pr pair <int, int>
using namespace std;
const int MAXN = 2e7 + 5, Mod = 998244353;
int n, m;
LL jc[MAXN], inv[MAXN], ans;
LL C(int x, int y) {
    if(x < 0 || y < 0 || x < y) return 0;
    return jc[x] * inv[y] % Mod * inv[x - y] % Mod;
}
LL Qpow(LL x, int y) {
    LL ans = 1;
    for(; y; y >>= 1) {
        if(y & 1) ans = ans * x % Mod;
        x = x * x % Mod;
    }
    return ans;
}
void read(int &x) {
	x = 0; bool f = 1; char c = getchar();
	for(; c < '0' || c > '9'; c = getchar()) if(c == '-') f = 0;
	for(; c >= '0' && c <= '9'; c = getchar()) x = (x << 1) + (x << 3) + (c ^ 48);
	x = (f ? x : -x);
}
int main() {
    read(n); read(m); jc[0] = 1; int t = sqrt(n);
    for(int i = 1; i <= (n << 1); i ++) jc[i] = jc[i - 1] * i % Mod;
    inv[n << 1] = Qpow(jc[n << 1], Mod - 2);
    for(int i = (n << 1) - 1; i >= 0; i --) inv[i] = inv[i + 1] * (i + 1) % Mod;
    for(int i = -t; i <= t; i ++) {
        int t = i * (3 * i - 1) / 2;
        ans = (ans + (i & 1 ? -1 : 1) * C(m + n - 1 - t, n)) % Mod;
    }
    printf("%lld", (ans * inv[n] % Mod + Mod) % Mod);
	return 0;
}
/*
g++ -o qoj8171 qoj8171.cpp -std=c++14 -O2 -Wall -Wextra -fno-ms-extensions -Wshadow -Wconversion
./qoj8171
*/