#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")

using namespace __gnu_pbds;
using namespace std;

#define ll long long
#define ld long double
#define mp make_pair
#define what_is(x) cerr << #x << " is " << x << endl;

typedef tree<
        int,
        null_type,
        less<int>,
        rb_tree_tag,
        tree_order_statistics_node_update>
        ordered_set;


const int p = 998244353;


int mul(int a, int b) {
    return (1LL * a%p * b%p) % p;
}

int add(int a, int b) {
    int s = (a+b);
    s = s%p;
    if (s<0) s+=p;
    return s;
}

int sub(int a, int b) {
    int s = (a-b);
    s = s%p;
    if (s<0) s+=p;
    return s;
}

int po(int a, int deg)
{
    if (deg==0) return 1;
    if (deg%2==1) return mul(a, po(a, deg-1));
    int t = po(a, deg/2);
    return mul(t, t);
}

int inv(int n)
{
    return po(n, p-2);
}

vector<int> Z(vector<int> s)
{
    int n = s.size();
    vector<int> z(n);
    int L = 0, R = 0;
    for (int i = 1; i < n; i++) {
        if (i > R) {
            L = R = i;
            while (R < n && s[R-L] == s[R]) R++;
            z[i] = R-L; R--;
        } else {
            int k = i-L;
            if (z[k] < R-i+1) z[i] = z[k];
            else {
                L = i;
                while (R < n && s[R-L] == s[R]) R++;
                z[i] = R-L; R--;
            }
        }
    }
    return z;
}

mt19937 rnd(time(0));
/*
struct Line {
    mutable ll k, m, p;
    bool operator<(const Line& o) const { return k < o.k; }
    bool operator<(ll x) const { return p < x; }
};

struct CHT : multiset<Line, less<>> {
    // (for doubles, use inf = 1/.0, div(a,b) = a/b)
    const ll inf = LLONG_MAX;
    ll div(ll a, ll b) { // floored division
        return a / b - ((a ^ b) < 0 && a % b); }
    bool isect(iterator x, iterator y) {
        if (y == end()) { x->p = inf; return false; }
        if (x->k == y->k) x->p = x->m > y->m ? inf : -inf;
        else x->p = div(y->m - x->m, x->k - y->k);
        return x->p >= y->p;
    }
    void add(ll k, ll m) {
        auto z = insert({k, m, 0}), y = z++, x = y;
        while (isect(y, z)) z = erase(z);
        if (x != begin() && isect(--x, y)) isect(x, y = erase(y));
        while ((y = x) != begin() && (--x)->p >= y->p)
            isect(x, erase(y));
    }
    ll query(ll x) {
        assert(!empty());
        auto l = *lower_bound(x);
        return l.k * x + l.m;
    }
};
*/

const int N = 3000010;

vector<int> facs(N);
vector<int> invfacs(N);

void init() {
    facs[0] = 1;
    for (int i = 1; i < N; i++) facs[i] = mul(facs[i - 1], i);
    invfacs[N - 1] = inv(facs[N - 1]);
    for (int i = N - 2; i >= 0; i--) invfacs[i] = mul(invfacs[i + 1], i + 1);
}


int C(int n, int k) {
    return mul(facs[n], mul(invfacs[n-k], invfacs[k]));
}

int main()
{
    ios_base::sync_with_stdio(0);

    init();
    int n, m;
    cin>>n>>m;
    int overall = 3*m;
    int res = 0;
    for (int odd = 0; odd<=min(m, n); odd++) if (odd%2 == overall%2)
    {
        res = add(res, mul(C(n, odd), C(n - 1 + (overall-odd)/2, n-1)));
    }
    overall = m-1;
    for (int odd = 0; odd<=min(m-1, n-1); odd++) if (odd%2 == overall%2)
    {
        res = sub(res, mul(mul(C(n-1, odd), n), C(n - 2 + (overall-odd)/2, n-2)));
    }
    overall = m-2;
    if (overall<0) {cout<<res; return 0;}
    for (int odd = 0; odd<=min(m-2, n); odd++) if (odd%2 == overall%2)
    {
        res = sub(res, mul(mul(C(n, odd), n), C(n - 1 + (overall-odd)/2, n-1)));
    }
    cout<<res;

}

Measured memory_bytes: 23680