#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e6 + 10;
const int mod = 998244353;
typedef long long ll;
#define int long long
int fac[maxn], inv[maxn];
int n, m;
int pw(int a, int n) {
	int res = 1;
	while(n) {
		if(n & 1) res = (ll)res * a % mod;
		a = (ll)a * a % mod, n >>= 1;
	}
	return res;
}
int INV(int a) {
	return pw(a, mod - 2);
}
void pre() {
	fac[0] = 1;
	for(int i = 1; i < maxn; i++) fac[i] = (ll)fac[i - 1] * i % mod;
	inv[maxn - 1] = INV(fac[maxn - 1]);
	for(int i = maxn - 2; i >= 0; i--) inv[i] = (ll)inv[i + 1] * (i + 1) % mod;
}
int C(int n, int m) {
	return (ll)fac[n] * inv[m] % mod * (ll)inv[n - m] % mod;
}
int H(int n, int m) {
	return C(n + m - 1, m);
}
void add(int& a, int b) {
	a += b;
	if(a >= mod) a -= mod;
}
void sub(int& a, int b) {
	a -= b;
	if(a < 0) a += mod;
}
int32_t main() {
	pre();
	scanf("%lld%lld", &n, &m);
	int ans = 0;
	for(int i = 0; i <= min(n, m); i++) if((3 * m - i) % 2 == 0) {
		add(ans, C(n, i) * H(n, (3 * m - i) / 2) % mod);
	}
	int tmp = 0;
	for(int i = 0; i <= min(n, m); i++) if((m - i) % 2 == 0) {
		add(tmp, C(n, i) * H(n, (m - i) / 2) % mod);
	}
	for(int i = 0; i <= min(n - 1, m); i++) if((m - i) % 2 == 0) {
		sub(tmp, C(n - 1, i) * H(n - 1, (m - i) / 2) % mod);
	}
	tmp = (ll)tmp * n % mod;
	sub(ans, tmp);
	printf("%lld\n", ans);
	return 0;
}

### Prompt

Please formulate a Cpp solution to the following problem:

We have a sequence of N integers: x=(x_0,x_1,\cdots,x_{N-1}). Initially, x_i=0 for each i (0 \leq i \leq N-1).

Snuke will perform the following operation exactly M times:

* Choose two distinct indices i, j (0 \leq i,j \leq N-1,\ i \neq j). Then, replace x_i with x_i+2 and x_j with x_j+1.



Find the number of different sequences that can result after M operations. Since it can be enormous, compute the count modulo 998244353.

Constraints

* 2 \leq N \leq 10^6
* 1 \leq M \leq 5 \times 10^5
* All values in input are integers.

Input

Input is given from Standard Input in the following format:


N M


Output

Print the number of different sequences that can result after M operations, modulo 998244353.

Examples

Input

2 2


Output

3


Input

3 2


Output

19


Input

10 10


Output

211428932


Input

100000 50000


Output

3463133

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e6 + 10;
const int mod = 998244353;
typedef long long ll;
#define int long long
int fac[maxn], inv[maxn];
int n, m;
int pw(int a, int n) {
	int res = 1;
	while(n) {
		if(n & 1) res = (ll)res * a % mod;
		a = (ll)a * a % mod, n >>= 1;
	}
	return res;
}
int INV(int a) {
	return pw(a, mod - 2);
}
void pre() {
	fac[0] = 1;
	for(int i = 1; i < maxn; i++) fac[i] = (ll)fac[i - 1] * i % mod;
	inv[maxn - 1] = INV(fac[maxn - 1]);
	for(int i = maxn - 2; i >= 0; i--) inv[i] = (ll)inv[i + 1] * (i + 1) % mod;
}
int C(int n, int m) {
	return (ll)fac[n] * inv[m] % mod * (ll)inv[n - m] % mod;
}
int H(int n, int m) {
	return C(n + m - 1, m);
}
void add(int& a, int b) {
	a += b;
	if(a >= mod) a -= mod;
}
void sub(int& a, int b) {
	a -= b;
	if(a < 0) a += mod;
}
int32_t main() {
	pre();
	scanf("%lld%lld", &n, &m);
	int ans = 0;
	for(int i = 0; i <= min(n, m); i++) if((3 * m - i) % 2 == 0) {
		add(ans, C(n, i) * H(n, (3 * m - i) / 2) % mod);
	}
	int tmp = 0;
	for(int i = 0; i <= min(n, m); i++) if((m - i) % 2 == 0) {
		add(tmp, C(n, i) * H(n, (m - i) / 2) % mod);
	}
	for(int i = 0; i <= min(n - 1, m); i++) if((m - i) % 2 == 0) {
		sub(tmp, C(n - 1, i) * H(n - 1, (m - i) / 2) % mod);
	}
	tmp = (ll)tmp * n % mod;
	sub(ans, tmp);
	printf("%lld\n", ans);
	return 0;
}

```