#include <bits/stdc++.h>
using namespace std;
const int Mod = 998244353;
inline int Add(int x, int y) { return (x += y) >= Mod ? x - Mod : x; }
inline void Inc(int &x, int y) { if((x += y) >= Mod) x -= Mod; }
inline int Sub(int x, int y) { return (x -= y) < 0 ? x + Mod : x; }
inline void Dec(int &x, int y) { if((x -= y) < 0) x += Mod; }
inline int Mul(int x, int y) { return (long long)x * y % Mod; }
inline int Sqr(int x) { return Mul(x, x); }
inline int Inv(int x) {
    int y = Mod - 2, r = 1;
    for(; y; y >>= 1, x = Mul(x, x))
        if(y & 1) r = Mul(r, x);
    return r;
}
vector<int> fac, ifac, iv;
void InitComb(const int n) {
    iv.resize(n + 1), fac.resize(n + 1), fac[0] = 1;
    for(int i = 1; i <= n; ++i) fac[i] = Mul(fac[i - 1], i);
    ifac.resize(n + 1), ifac[n] = Inv(fac[n]);
    for(int i = n; i >= 1; --i) ifac[i - 1] = Mul(ifac[i], i);
    for(int i = 1; i <= n; ++i) iv[i] = Mul(fac[i - 1], ifac[i]);
}
int C(int n, int m) { return (m < 0 || m > n) ? 0 : Mul(fac[n], Mul(ifac[m], ifac[n - m])); }
int main() {
    cin.tie(0)->sync_with_stdio(0);
    int n, m; cin >> n >> m, --m, InitComb(n * 2);
    int ans = Mul(fac[n + m], ifac[m]);
    const auto work = [&](auto &&f, int p)
        { f(ans, Mul(fac[n + m - p], ifac[m - p])); };
    for(int i = 1, p = 0; (p += 3 * i - 2) <= m; ++i) {
        const auto f = i & 1 ? Dec : Inc;
        work(f, p); if(p + i <= m) work(f, p + i);
    }
    printf("%d", Mul(ans, Sqr(ifac[n])));
}