import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


struct ModInt(long M) {
  long x;
  this(in ModInt a) { x = a.x; }
  this(in long a) { x = a % M; if (x < 0) x += M; }
  ModInt opUnary(string op)() if (op == "-") { return ModInt(-x); }
  ref ModInt opOpAssign(string op)(in ModInt a) {
    static if (op == "+") { x += a.x; if (x >= M) x -= M; }
    else static if (op == "-") { x -= a.x; if (x < 0) x += M; }
    else static if (op == "*") { x *= a.x; x %= M; }
    else static assert(false);
    return this;
  }
  ModInt opOpAssign(string op)(in long a) { return mixin("this " ~ op ~ "= ModInt(a)"); }
  ModInt opBinary(string op, T)(in T a) const { return mixin("ModInt(this) " ~ op ~ "= a"); }
  ModInt opBinaryRight(string op)(in long a) const { return mixin("ModInt(a) " ~ op ~ "= this"); }
  string toString() const { return x.to!string; }
}


enum long MO = 998244353;
alias Mint = ModInt!MO;
enum LIM = 10^^7;


long[] inv, fac, invFac;
void prepare() {
  inv = new long[LIM];
  fac = new long[LIM];
  invFac = new long[LIM];
  inv[1] = 1;
  foreach (i; 2 .. LIM) {
    inv[i] = MO - ((MO / i) * inv[cast(size_t)(MO % i)]) % MO;
  }
  fac[0] = invFac[0] = 1;
  foreach (i; 1 .. LIM) {
    fac[i] = (fac[i - 1] * i) % MO;
    invFac[i] = (invFac[i - 1] * inv[i]) % MO;
  }
}
long binom(long n, long k) {
  if (0 <= k && k <= n) {
    assert(n < LIM);
    return fac[cast(size_t)(n)] * invFac[cast(size_t)(k)] % MO * invFac[cast(size_t)(n - k)] % MO;
  } else {
    return 0;
  }
}


long N, M;

void main() {
  prepare();
  
  //*
  debug {
    {
      enum n = 5, m = 2;
      int[][] as;
      foreach (p; 0 .. n^^(2 * m)) {
        bool ok = true;
        auto a = new int[n];
        foreach (i; 0 .. m) {
          const u = p / n^^(2 * i + 0) % n;
          const v = p / n^^(2 * i + 1) % n;
          ok = ok && (u != v);
          a[u] += 2;
          a[v] += 1;
        }
        if (ok) {
          a.sort.reverse;
          as ~= a;
        }
      }
      as = as.sort.uniq.array;
      foreach (a; as) {
        writeln(a);
      }
    }
  }
  //*/
  
  try {
    for (; ; ) {
      N = readLong();
      M = readLong();
      
      Mint ans;
      for (long k = M % 2; k <= M; k += 2) {
        {
          const m = (3 * M - k) / 2;
          Mint tmp = 1;
          tmp *= binom(N + m - 1, m);
          tmp *= binom(N, k);
          debug {
            if (M <= 5) {
              writeln(k, " ", m, " ", tmp);
            }
          }
          ans += tmp;
        }
        {
          const m = (3 * M - k) / 2 - M;
          if (m >= 0) {
            Mint tmp = -1;
            tmp *= N;
            tmp *= binom((N - 1) + (m - 1), m);
            tmp *= binom(N - 1, k - 1);
            debug {
              if (M <= 5) {
                writeln(k, " ", m, " ", tmp);
              }
            }
            ans += tmp;
          }
        }
        {
          const m = (3 * M - k) / 2 - (M + 1);
          if (m >= 0) {
            Mint tmp = -1;
            tmp *= N;
            tmp *= binom(N + m - 1, m);
            tmp *= binom(N, k);
            debug {
              if (M <= 5) {
                writeln(k, " ", m, " ", tmp);
              }
            }
            ans += tmp;
          }
        }
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}


Measured memory_bytes: 239740