#include <iostream>
#include <vector>

using namespace std;

const int MOD = 998244353;

int main(){
    const int maxSize = 2000001;
	vector<long long> inv(maxSize);
	vector<long long> fact(maxSize);
	vector<long long> factInv(maxSize);
	for(int i=0;i<2;i++) inv[i] = fact[i] = factInv[i] = 1;
	for(int i=2;i<maxSize;i++){
		inv[i] = inv[MOD % i] * (MOD - MOD / i) % MOD;
		fact[i] = fact[i-1] * i % MOD;
		factInv[i] = factInv[i-1] * inv[i] % MOD;
	}
	auto comb = [&](int n, int r){
		if(n < r || r < 0) return 0LL;
		return fact[n] * factInv[n-r] % MOD * factInv[r] % MOD;
	};
    auto perm = [&](int n, int r){
        if(n < r || r < 0) return 0LL;
        return fact[n] * factInv[n-r] % MOD;
    };
    int N, M; cin >> N >> M;
    long long res = 0;
    for(int m=0;2*m<=M;m++){
        int m2 = M + m;
        int m1 = M - 2*m;
        if(m1 > N) continue;
        res = (res + comb(m2+N-1, N-1) * comb(N, m1)) % MOD;
        if(m1 > 0){
            res = (res + MOD - (comb(m2-M+N-2, N-2) * comb(N-1, m1-1)) % MOD * N % MOD) % MOD;
        }
        if(m2 >= M+1){
            res = (res + MOD - (comb(m2-M-1+N-1, N-1) * comb(N, m1)) % MOD * N % MOD) % MOD;
        }
    }
    cout << res << endl;
}
### Prompt

Generate 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 <iostream>
#include <vector>

using namespace std;

const int MOD = 998244353;

int main(){
    const int maxSize = 2000001;
	vector<long long> inv(maxSize);
	vector<long long> fact(maxSize);
	vector<long long> factInv(maxSize);
	for(int i=0;i<2;i++) inv[i] = fact[i] = factInv[i] = 1;
	for(int i=2;i<maxSize;i++){
		inv[i] = inv[MOD % i] * (MOD - MOD / i) % MOD;
		fact[i] = fact[i-1] * i % MOD;
		factInv[i] = factInv[i-1] * inv[i] % MOD;
	}
	auto comb = [&](int n, int r){
		if(n < r || r < 0) return 0LL;
		return fact[n] * factInv[n-r] % MOD * factInv[r] % MOD;
	};
    auto perm = [&](int n, int r){
        if(n < r || r < 0) return 0LL;
        return fact[n] * factInv[n-r] % MOD;
    };
    int N, M; cin >> N >> M;
    long long res = 0;
    for(int m=0;2*m<=M;m++){
        int m2 = M + m;
        int m1 = M - 2*m;
        if(m1 > N) continue;
        res = (res + comb(m2+N-1, N-1) * comb(N, m1)) % MOD;
        if(m1 > 0){
            res = (res + MOD - (comb(m2-M+N-2, N-2) * comb(N-1, m1-1)) % MOD * N % MOD) % MOD;
        }
        if(m2 >= M+1){
            res = (res + MOD - (comb(m2-M-1+N-1, N-1) * comb(N, m1)) % MOD * N % MOD) % MOD;
        }
    }
    cout << res << endl;
}
```