// #define DEBUGGING
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ALL(V) (V).begin(), (V).end()
#define ALLR(V) (V).rbegin(), (V).rend()

template <typename T> using V = vector<T>;
template <typename T> using VV = V<V<T>>;
using ll = int64_t;
using ull = uint64_t;
using PLL = pair<ll, ll>;

template <typename T> const T& var_min(const T &t) { return t; }
template <typename T> const T& var_max(const T &t) { return t; }
template <typename T, typename... Tail> const T& var_min(const T &t, const Tail&... tail) { return min(t, var_min(tail...)); }
template <typename T, typename... Tail> const T& var_max(const T &t, const Tail&... tail) { return max(t, var_max(tail...)); }
template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); }
template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); }
template <typename T> const T& clamp(const T &t, const T &low, const T &high) { return max(low, min(high, t)); }
template <typename T> void chclamp(T &t, const T &low, const T &high) { t = clamp(t, low, high); }

namespace init__ {

struct InitIO {
    InitIO() {
        cin.tie(nullptr);
        ios_base::sync_with_stdio(false);
        cout << fixed << setprecision(30);
    }
} init_io;

}

#ifdef DEBUGGING
// #include "../debug/debug.cpp"
#include "../../debug/debug.cpp"
#else
#define DEBUG(...) 0
#define DEBUG_SEPARATOR_LINE 0
#endif

template <typename T>
T make_v(T init) { return init; }

template <typename T, typename... Tail>
auto make_v(T init, size_t s, Tail... tail) {
#define rec make_v(init, tail...)
    return V<decltype(rec)>(s, rec);
#undef rec
}

template <ll MOD>
class Combination {
private:
    template <typename T> using V = vector<ll>;
    ll N;
    V<ll> factv, rfactv;

public:
    /*
     * MOD must be a prime number.
     */
    Combination<MOD> (ll N)
        : N(N), 
          factv(N + 1, 1),
          rfactv(N + 1)
    {
        for(ll i = 1; i <= N; i++) {
            factv[i] = factv[i - 1] * i % MOD;
        }
        for(ll i = 0; i <= N; i++) {
            rfactv[i] = pow(factv[i], MOD - 2);
        }
    }

    ll fact(ll n) {
        return factv[n];
    }

    ll rfact(ll n) {
        return rfactv[n];
    }

    ll pow(ll a, ll b) {
        return b ? (b & 1 ? a : 1) * pow(a * a % MOD, b / 2) % MOD : 1;
    }

    ll comb(ll n, ll k) {
        return factv[n] * rfactv[n - k] % MOD * rfactv[k] % MOD;
    }
};

const ll mod = 998244353;
Combination<mod> comb(5e6);

int main() {
    ll N, M;
    cin >> N >> M;

    /*
    V<ll> comb_list(3 * M + 10);
    for(ll i = 2 * N - 1; i < comb_list.size(); i++) comb_list[i] = comb.comb(i, 2 * N - 1);

    V<ll> odd_sum(comb_list.size() + 1), even_sum(comb_list.size() + 1);
    for(ll i = 2 * N - 1; i < comb_list.size(); i++) {
        odd_sum[i + 1] = odd_sum[i];
        even_sum[i + 1] = even_sum[i];
        ((i & 1 ? odd_sum : even_sum)[i + 1] += comb_list[i]) %= mod;
    }
    */

    ll ans = 0;
    ll lines = N - 1;
    for(ll k = (M & 1); k <= min(M, N); k += 2) {
        ll select = comb.comb(N, k);
        ll rest = M * 3 - k;
        rest /= 2;
        ll distr = comb.comb(rest + lines, lines);
        ll perm = distr * select % mod;
        DEBUG(perm);
        (ans += perm) %= mod;
    }

    for(ll i = M + 1; i <= 2 * M; i++) {
        ll rest = 2 * M - i;
        ll distr = comb.comb(rest + lines - 1, lines - 1);
        ll perm = distr * N % mod;
        (ans += mod - perm) %= mod;
    }

    cout << ans << endl;
    return 0;
}


Measured memory_bytes: 78336