#include <iostream>
#define llint long long
#define mod 998244353

using namespace std;

llint n, m;
const int FACT_MAX = 4000005;
llint fact[FACT_MAX], fact_inv[FACT_MAX];

llint modpow(llint a, llint n)
{
	if(n == 0) return 1;
	if(n % 2){
		return ((a%mod) * (modpow(a, n-1)%mod)) % mod;
	}
	else{
		return modpow((a*a)%mod, n/2) % mod;
	}
}

void make_fact()
{
	llint val = 1;
	fact[0] = 1;
	for(int i = 1; i < FACT_MAX; i++){
		val *= i;
		val %= mod;
		fact[i] = val;
	}
	fact_inv[FACT_MAX-1] = modpow(fact[FACT_MAX-1], mod-2);
	for(int i = FACT_MAX-2; i >= 0; i--){
		fact_inv[i] = fact_inv[i+1] * (i+1) % mod;
	}
}

llint comb(llint n, llint k)
{
	llint ret = 1;
	ret *= fact[n];
	ret *= fact_inv[k], ret %= mod;
	ret *= fact_inv[n-k], ret %= mod;
	return ret;
}

int main(void)
{
	cin >> n >> m;
	make_fact();
	
	llint ans = 0;
	for(int i = 0; i <= min(m, n); i++){
		if(m%2 != i%2) continue;
		llint rem = (3*m-i)/2;
		llint tmp = comb(rem+n-1, n-1);
		if(rem-(m+1) >= 0) tmp += mod - (n-i) * comb(rem-(m+1)+n-1, n-1) % mod, tmp %= mod;
		if(rem-m >= 0) tmp += mod - i * comb(rem-m+n-1, n-1) % mod, tmp %= mod;
		ans += tmp * comb(n, i) % mod, ans %= mod;
	}
	cout << ans << endl;
	
	return 0;
}
### Prompt

In CPP, your task is to solve 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 <iostream>
#define llint long long
#define mod 998244353

using namespace std;

llint n, m;
const int FACT_MAX = 4000005;
llint fact[FACT_MAX], fact_inv[FACT_MAX];

llint modpow(llint a, llint n)
{
	if(n == 0) return 1;
	if(n % 2){
		return ((a%mod) * (modpow(a, n-1)%mod)) % mod;
	}
	else{
		return modpow((a*a)%mod, n/2) % mod;
	}
}

void make_fact()
{
	llint val = 1;
	fact[0] = 1;
	for(int i = 1; i < FACT_MAX; i++){
		val *= i;
		val %= mod;
		fact[i] = val;
	}
	fact_inv[FACT_MAX-1] = modpow(fact[FACT_MAX-1], mod-2);
	for(int i = FACT_MAX-2; i >= 0; i--){
		fact_inv[i] = fact_inv[i+1] * (i+1) % mod;
	}
}

llint comb(llint n, llint k)
{
	llint ret = 1;
	ret *= fact[n];
	ret *= fact_inv[k], ret %= mod;
	ret *= fact_inv[n-k], ret %= mod;
	return ret;
}

int main(void)
{
	cin >> n >> m;
	make_fact();
	
	llint ans = 0;
	for(int i = 0; i <= min(m, n); i++){
		if(m%2 != i%2) continue;
		llint rem = (3*m-i)/2;
		llint tmp = comb(rem+n-1, n-1);
		if(rem-(m+1) >= 0) tmp += mod - (n-i) * comb(rem-(m+1)+n-1, n-1) % mod, tmp %= mod;
		if(rem-m >= 0) tmp += mod - i * comb(rem-m+n-1, n-1) % mod, tmp %= mod;
		ans += tmp * comb(n, i) % mod, ans %= mod;
	}
	cout << ans << endl;
	
	return 0;
}
```