#include <bits/stdc++.h>

using namespace std;

void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

#define SPEED ios_base::sync_with_stdio(false);cin.tie(nullptr)
#define rep(i,n) for(int i=0; i<(int)(n); i++)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }

using ll = long long;
using P = pair<ll, ll>;

constexpr ll mod = 998244353;
constexpr double PI = 3.14159265358979323846;
mt19937_64 engine(chrono::steady_clock::now().time_since_epoch().count());


unordered_map<ll, ll> minvmap;
ll minv(ll a, ll m) {
  auto k = a; auto p = minvmap[a]; if (p != 0) return p;
  ll b = m, u = 1, v = 0;
  while (b) { ll t = a/b; swap(a -= t*b, b); swap(u -= t*v, v); }
  p = (u%m+m)%m; minvmap[k] = p; return p;
}
struct mint {
    ll x;
    mint():x(0){}
    mint(ll x):x((x%mod+mod)%mod){}
    mint& fix() { x = (x%mod+mod)%mod; return *this;}
    mint operator-() const { return mint(0) - *this;}
    mint& operator+=(const mint& a){ if((x+=a.x)>=mod) x-=mod; return *this;}
    mint& operator-=(const mint& a){ if((x+=mod-a.x)>=mod) x-=mod; return *this;}
    mint& operator*=(const mint& a){ (x*=a.x)%=mod; return *this;}
    mint& operator/=(const mint& a){ (x*=minv(a.x, mod))%=mod; return *this; }
    mint operator+(const mint& a)const{ return mint(*this) += a;}
    mint operator-(const mint& a)const{ return mint(*this) -= a;}
    mint operator*(const mint& a)const{ return mint(*this) *= a;}
    mint operator/(const mint& a)const{ return mint(*this) /= a;}
    bool operator<(const mint& a)const{ return x < a.x;}
    bool operator==(const mint& a)const{ return x == a.x;}
};
istream& operator>>(istream&i,mint&a){i>>a.x;return i;}
ostream& operator<<(ostream&o,const mint&a){o<<a.x;return o;}

mint mod_pow(mint a, ll x) {
  mint res = 1;
  while(x > 0) {
    if (x & 1) res *= a;
    a *= a; x >>= 1;
  }
  return res;
}

int MAXN = 3000000;
// factorial
vector<mint> fact(MAXN+1);
void init() {
  fact[0] = 1;
  for(int i=1; i<=MAXN; i++) fact[i] = fact[i-1]*i;
}

// nCr
mint comb(int n, int r) {
  if (n < r || n < 0 || r < 0) return 0;
  return fact[n]/(fact[r]*fact[n-r]);
}

// Matrix library

// return a * b where a and b are n * n matrix
vector<mint> mat_mul(const vector<mint>& a, const vector<mint>& b, int n) {
  vector<mint> ret(n*n);
  rep(i, n) rep(j, n) rep(k, n) ret[i*n+j] += a[i*n+k]*b[k*n+j];
  return ret;
}

// return identity matrix of size n * n
vector<mint> id_mat(int n) {
  vector<mint> ret(n*n);
  rep(i, n) ret[i*n+i] = 1;
  return ret;
}

// return a^x where a is n * n matrix
// a is changed, so do not use &a
vector<mint> mat_pow(vector<mint> a, ll x, int n) {
  vector<mint> ret = id_mat(n);
  while(x>0) {
    if (x&1) ret = mat_mul(ret, a, n);
    a = mat_mul(a, a, n); x>>=1;
  }
  return ret;
}

signed main() {
  SPEED;
  int n, m; cin >> n >> m;
  init();

  mint all = comb(3*m+n-1, n-1);

  mint ng1 = 0;
  for(int i=m-1; i>=0; i--) {
    mint tmp = comb(i+n-2, n-2);
    if (i==0 || n==2) {
      tmp = 1;
    }
    ng1 += tmp*n;
  }

  mint ng2 = 0;
  for(int i=m+1; i<=n; i++) {
    if ((3*m-i)%2!=0) continue;
    int r = (3*m-i)/2;
    if (r<0) continue;
    mint tmp = comb(r+n-1, n-1);
    tmp *= comb(n, i);
    ng2 += tmp;
  }
  debug(ng2.x);



  cout << all-ng1-ng2 << endl;

}

Measured memory_bytes: 63248