#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <functional>
#include <ctime>
#include <cmath>
#include <limits>
#include <numeric>
#include <type_traits>
#include <iomanip>
#include <float.h>
#include <math.h>
using namespace std;
using ll = long long;


unsigned euclidean_gcd(unsigned a, unsigned b) {
    if (a < b) return euclidean_gcd(b, a);
    unsigned r;
    while ((r = a % b)) {
        a = b;
        b = r;
    }
    return b;
}

class UnionFind {
public:
    vector <ll> par;
    vector <ll> siz;
    UnionFind(ll sz_) : par(sz_), siz(sz_, 1LL) {
        for (ll i = 0; i < sz_; ++i) par[i] = i;
    }
    void init(ll sz_) {
        par.resize(sz_);
        siz.assign(sz_, 1LL);
        for (ll i = 0; i < sz_; ++i) par[i] = i;
    }
    ll root(ll x) {
        while (par[x] != x) {
            x = par[x] = par[par[x]];
        }
        return x;
    }
    bool merge(ll x, ll y) {
        x = root(x);
        y = root(y);
        if (x == y) return false;
        if (siz[x] < siz[y]) swap(x, y);
        siz[x] += siz[y];
        par[y] = x;
        return true;
    }

    bool issame(ll x, ll y) {
        return root(x) == root(y);
    }

    ll size(ll x) {
        return siz[root(x)];
    }
};

long long modpow(long long a, long long n, long long mod) {
    long long res = 1;
    while (n > 0) {
        if (n & 1) res = res * a % mod;
        a = a * a % mod;
        n >>= 1;
    }
    return res;
}

long long modinv(long long a, long long mod) {
    return modpow(a, mod - 2, mod);
}

int main() {
    ll n, m;
    cin >> n >> m;
    ll ans = 0;
    vector<ll>bik(9500000);
    bik.at(0) = 1;
    for (int i = 1; i < 9500000; i++) {
        bik.at(i) = bik.at(i - 1) * i % 998244353;
    }
    if (n <= m) {
        ll yoji = 0;
        ans = bik.at(3 * m + n - 1) * modinv(bik.at(n - 1), 998244353)%998244353*modinv(bik.at(3*m), 998244353) % 998244353;
        yoji= bik.at(m + n - 2) * modinv(bik.at(n - 1), 998244353) % 998244353 * modinv(bik.at(m-1), 998244353) % 998244353 * n % 998244353;
        ans -= yoji;
        ans += 998244353;
        ans %= 998244353;
    }
    else {
        ll f = 3 * m % 2;
            for (int i = f; i < m+1; i+=2) {
                ll zans;
                
                zans = bik.at((3*m-i)/2+n-1) % 998244353 * modinv(bik.at(n - 1), 998244353) % 998244353 * modinv(bik.at((3 * m - i)/2), 998244353) % 998244353;
                ll yojik=1;
                ll yojig=1;
                yojik *= bik.at(n -1+(m-i)/2) % 998244353 * modinv(bik.at(n - 1), 998244353) % 998244353 * modinv(bik.at((m-i)/2), 998244353) % 998244353 * i % 998244353;
                if (i >= m-1)yojig = 0;
                else yojig *= bik.at(n -1+(m-i-2)/2) % 998244353 * modinv(bik.at(n - 1), 998244353) % 998244353 * modinv(bik.at((m-i-2)/2), 998244353) % 998244353 * (n-i) % 998244353;
                zans -= yojik + yojig;
                zans += 998244353;
                zans += 998244353;
                zans %= 998244353;
                zans *= bik.at(n) % 998244353 * modinv(bik.at(n-i), 998244353) % 998244353 * modinv(bik.at(i), 998244353) % 998244353;
                zans %= 998244353;
                ans += zans;
                ans %= 998244353;
            }
    }
    cout << ans << endl;
}

Measured memory_bytes: 74624