//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("unroll-loops")

#include <iostream>
#include <stdlib.h>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <unordered_map>
#include <random>
#include <assert.h>
#include <memory.h>
#include <time.h>
#include <bitset>

#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define ld long double
#define rep(i, l, r) for (int i = l; i < r; i++)
#define repb(i, r, l) for (int i = r; i > l; i--)
#define sz(a) (int)a.size()
#define fi first
#define se second
#define mp(a, b) make_pair(a, b)
#define rank qwertyuio
#define next dfghjk

using namespace std;

inline bool setmin(int &x, int y) { return (y < x) ? x = y, 1 : 0; }
inline bool setmax(int &x, int y) { return (y > x) ? x = y, 1 : 0; }
inline bool setmin(ll &x, ll y) { return (y < x) ? x = y, 1 : 0; }
inline bool setmax(ll &x, ll y) { return (y > x) ? x = y, 1 : 0; }

const int N = 3000000;
const int inf = (int)1e9 + 1;
const ll big = (ll)1e18 + 1;
const int P = 239;
const int P1 = 31;
const int P2 = 57;
//const int MOD = (int)1e9 + 7;
const int MOD1 = (int)1e9 + 9;
const int MOD = 998244353;
const double eps = 1e-9;
const double pi = atan2(0, -1);
const int ABC = 26;

ll bin_pow(ll a, ll p) {
    ll res = 1;
    while (p) {
        if (p & 1) {
            res = res * a % MOD;
        }
        a = a * a % MOD;
        p >>= 1;
    }
    return res;
}

ll rev(ll x) {
    return bin_pow(x, MOD - 2);
}

ll fact[N], rfact[N];

void init() {
    fact[0] = 1;
    rep(i, 1, N) {
        fact[i] = fact[i - 1] * i % MOD;
    }
    rfact[N - 1] = rev(fact[N - 1]);
    repb(i, N - 2, -1) {
        rfact[i] = rfact[i + 1] * (i + 1) % MOD;
    }
}

ll C(int n, int k) {
    if (k < 0 || k > n) {
        return 0;
    }
    return fact[n] * rfact[k] % MOD * rfact[n - k] % MOD;
}

ll CntWays(int stones, int piles) {
    if (stones < 0 || piles < 0) {
        return 0;
    }
    if (stones > 0 && piles == 0) {
        return 0;
    }
    if (stones == 0 && piles == 0) {
        return 1;
    }
    return C(stones + piles - 1, stones);
}

ll pref[N];

int main()
{
    //freopen("a.in", "r", stdin);
    //freopen("a.out", "w", stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.precision(20);
    cout << fixed;
    //ll TL = 0.95 * CLOCKS_PER_SEC;
    //clock_t time = clock();
    init();
    int n, m;
    cin >> n >> m;
    rep(i, 0, N) {
        pref[i] = C(i, n - 2);
        if (i > 0) {
            pref[i] += pref[i - 1];
            if (pref[i] >= MOD) {
                pref[i] -= MOD;
            }
        }
    }
    ll ans = 0;
    rep(c1, 0, n + 1) {
        if (c1 > m || c1 % 2 != m % 2) {
            continue;
        }
        int k = (3 * m - c1) / 2;
        ll tot = CntWays(k, n);
        //cout << c1 << " " << tot << endl;
        ll bad = pref[(n - 1) + (k - m) - 1] * n % MOD;
        tot -= bad;
        if (tot < 0) {
            tot += MOD;
        }
        ll good = (n - c1) * CntWays(k - m, n - 1) % MOD;
        tot += good;
        if (tot >= MOD) {
            tot -= MOD;
        }
        ans += C(n, c1) * tot % MOD;
        if (ans >= MOD) {
            ans -= MOD;
        }
    }
    cout << ans << "\n";
    return 0;
}

Measured memory_bytes: 70528