# include <bits/stdc++.h>
# define int long long
using namespace std;
using i64 = long long; 
const int N = 1e7 + 5, mod = 998244353; 
int n, m, coef[N], fac[N], ifac[N]; 

int qpow(int x, int p = mod - 2)
{
    int ans = 1; 
    while(p)
    {
        if(p & 1) ans = 1ll * ans * x % mod; 
        x = 1ll * x * x % mod, p >>= 1; 
    }
    return ans; 
}

void Init(int n = N - 5)
{
    for(int k = -5000; k <= 5000; k++)
    {
        int alpha = (3 * k * k - k) / 2; 
        if(alpha <= n) coef[alpha] += ((k & 1) ? -1 : 1); 
    }
    fac[0] = ifac[0] = 1; 
    for(int i = 1; i <= n; i++) fac[i] = 1ll * fac[i - 1] * i % mod; 
    ifac[n] = qpow(fac[n]); 
    for(int i = n - 1; i >= 1; i--) ifac[i] = 1ll * ifac[i + 1] * (i + 1ll) % mod; 
    return; 
}

int C(int n, int m)
{
    return 1ll * fac[n] * ifac[m] % mod * ifac[n - m] % mod; 
}

signed main(void)
{
    scanf("%lld%lld", &n, &m); 
    Init(); 
    int Ans = 0; 
    for(int s = 0; s <= m - 1; s++)
    {
        Ans = (1ll * Ans + 1ll * C(n + m - 1 - s, n) * coef[s] % mod + mod) % mod; 
    }
    printf("%lld\n", 1ll * Ans * ifac[n] % mod); 
    return 0; 
}