//start of jonathanirvings' template v3.0.3 (BETA)

#include <bits/stdc++.h>
using namespace std;

typedef long long LL;
typedef pair<int,int> pii;
typedef pair<LL,LL> pll;
typedef pair<string,string> pss;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vii;
typedef vector<LL> vl;
typedef vector<vl> vvl;

double EPS = 1e-9;
int INF = 1000000005;
long long INFF = 1000000000000000005LL;
double PI = acos(-1);
int dirx[8] = {-1,0,0,1,-1,-1,1,1};
int diry[8] = {0,1,-1,0,-1,1,-1,1};

#ifdef TESTING
  #define DEBUG fprintf(stderr,"====TESTING====\n")
  #define VALUE(x) cerr << "The value of " << #x << " is " << x << endl
  #define debug(...) fprintf(stderr, __VA_ARGS__)
#else
  #define DEBUG 
  #define VALUE(x)
  #define debug(...)
#endif

#define FOR(a,b,c) for (int (a)=(b);(a)<(c);++(a))
#define FORN(a,b,c) for (int (a)=(b);(a)<=(c);++(a))
#define FORD(a,b,c) for (int (a)=(b);(a)>=(c);--(a))
#define FORSQ(a,b,c) for (int (a)=(b);(a)*(a)<=(c);++(a))
#define FORC(a,b,c) for (char (a)=(b);(a)<=(c);++(a))
#define FOREACH(a,b) for (auto &(a) : (b))
#define REP(i,n) FOR(i,0,n)
#define REPN(i,n) FORN(i,1,n)
#define MAX(a,b) a = max(a,b)
#define MIN(a,b) a = min(a,b)
#define SQR(x) ((LL)(x) * (x))
#define RESET(a,b) memset(a,b,sizeof(a))
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ALL(v) v.begin(),v.end()
#define ALLA(arr,sz) arr,arr+sz
#define SIZE(v) (int)v.size()
#define SORT(v) sort(ALL(v))
#define REVERSE(v) reverse(ALL(v))
#define SORTA(arr,sz) sort(ALLA(arr,sz))
#define REVERSEA(arr,sz) reverse(ALLA(arr,sz))
#define PERMUTE next_permutation
#define TC(t) while(t--)

inline string IntToString(LL a){
  char x[100];
  sprintf(x,"%lld",a); string s = x;
  return s;
}

inline LL StringToInt(string a){
  char x[100]; LL res;
  strcpy(x,a.c_str()); sscanf(x,"%lld",&res);
  return res;
}

inline string GetString(void){
  char x[1000005];
  scanf("%s",x); string s = x;
  return s;
}

inline string uppercase(string s){
  int n = SIZE(s); 
  REP(i,n) if (s[i] >= 'a' && s[i] <= 'z') s[i] = s[i] - 'a' + 'A';
  return s;
}

inline string lowercase(string s){
  int n = SIZE(s); 
  REP(i,n) if (s[i] >= 'A' && s[i] <= 'Z') s[i] = s[i] - 'A' + 'a';
  return s;
}

inline void OPEN (string s) {
  #ifndef TESTING
  freopen ((s + ".in").c_str (), "r", stdin);
  freopen ((s + ".out").c_str (), "w", stdout);
  #endif
}

//end of jonathanirvings' template v3.0.3 (BETA)

namespace bf {

vi data;
set<vi> s;
set<vi> dah;

void dfs(int now)
{
  if (dah.count(data)) return;
  dah.insert(data);
  if (now == 0)
  {
    s.insert(data);
    return;
  }
  REP(i,SIZE(data)) REP(j,SIZE(data)) if (i != j)
  {
    data[i] += 2;
    data[j] += 1;
    dfs(now-1);
    data[i] -= 2;
    data[j] -= 1;
  }
}

int solve(int n, int m)
{
  data.resize(n); REP(i,n) data[i] = 0; s.clear(); dah.clear();
  dfs(m);
  return SIZE(s);
}

}  // namespace bf

const LL MOD = 998244353;
const int N = 5000001;
LL f[N + 5];
LL invf[N + 5];

LL bigpow(LL a,LL b)
{
  if (b == 0) return 1;
  LL tmp = bigpow(a,b/2);
  LL tmp2 = tmp * tmp % MOD;
  if (b % 2 == 0) return tmp2;
  return tmp2 * a % MOD;
}

LL C(LL n,LL k)
{
  if (n < k) return 0;
  return f[n] * invf[k] % MOD * invf[n-k] % MOD;
}

LL starsbars(LL slots, LL sum)
{
  // debug("%d %d\n",slots,sum);
  if (sum < 0) return 0;
  return C(sum + slots - 1, slots - 1);
}

LL all(int n,int m)
{
  // debug("all\n");
  return starsbars(n,3*m);
}

LL harus3(int n,int m)
{
  // debug("harus3\n");
  LL res = 0;
  FORN(i,1,n)
  {
    LL sum = 3 * m - (LL)(2 * m + 1) * i;
    LL pilih = C(n,i);
    LL now = pilih * starsbars(n,sum) % MOD;
    if (i % 2 == 1) res += now;
    else res -= now;
  }
  res %= MOD;
  if (res < 0) res += MOD;
  return res;
}

LL harus111(int n,int m)
{
  // debug("harus111\n");
  LL res = 0;
  FORN(i,m+1,n)
  {
    LL sum = 3 * m - i;
    LL pilih = C(n,i);
    if (sum % 2 != 0) continue;
    LL now = pilih * starsbars(n,sum/2) % MOD;
    if ((i - (m + 1)) % 2 == 1) res += now;
    else res -= now;
  }
  res %= MOD;
  if (res < 0) res += MOD;
  return res;
}

LL ans(int n, int m)
{
  LL res = all(n,m) - harus3(n,m) - harus111(n,m);
  res %= MOD;
  if (res < 0) res += MOD;
  return res;
}

int main()
{
  f[0] = 1;
  FORN(i,1,N) f[i] = f[i-1] * i % MOD;
  invf[N] = bigpow(f[N],MOD-2);
  FORD(i,N-1,0) invf[i] = invf[i+1] * (i + 1) % MOD;
  // VALUE(C(5,2));

  // FORN(i,1,7)
  // {
  //   FORN(j,1,7) assert(ans(i,j) == bf::solve(i,j));
  //   puts("");
  // }
  int n, m;
  scanf("%d %d",&n,&m);
  printf("%lld\n",ans(n,m));
  return 0;
}











Measured memory_bytes: 78336