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
#include<bits/stdc++.h>
#define MAXN 3000005
#define INF 1000000000
#define MOD 998244353
#define F first
#define S second
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int fact[MAXN],invf[MAXN];
int N,M;
void add(int &a,int b) {a+=b; if(a>=MOD) a-=MOD;}
void dec(int &a,int b) {a-=b; if(a<0) a+=MOD;}
int pow_mod(int a,int i)
{
    int s=1;
    while(i)
    {
        if(i&1) s=1LL*s*a%MOD;
        a=1LL*a*a%MOD;
        i>>=1;
    }
    return s;
}
int comb(int n,int k)
{
    if(n<k) return 0;
    return 1LL*fact[n]*invf[k]%MOD*invf[n-k]%MOD;
}
int main()
{
    fact[0]=invf[0]=1;
    for(int i=1;i<=3000000;i++) fact[i]=1LL*fact[i-1]*i%MOD;
    invf[3000000]=pow_mod(fact[3000000],MOD-2);
    for(int i=2999999;i>=1;i--) invf[i]=1LL*invf[i+1]*(i+1)%MOD;
    scanf("%d%d",&N,&M);
    int ans=0;
    for(int i=0;i<=M;i++) if((3*M-i)%2==0) add(ans,1LL*comb(N,i)*comb((3*M-i)/2+N-1,N-1)%MOD);
    for(int i=0;i<=M;i++) if((M-i)%2==0) dec(ans,1LL*N*comb(N,i)%MOD*comb((M-i)/2+N-1,N-1)%MOD);
    for(int i=0;i<=M;i++) if((M-i)%2==0) add(ans,1LL*N*comb(N-1,i)%MOD*comb((M-i)/2+N-2,N-2)%MOD);
    printf("%d\n",ans);
    return 0;
}
