Problem: In Republic of AtCoder, Snuke Chameleons (Family: Chamaeleonidae, Genus: Bartaberia) are very popular pets. Ringo keeps N Snuke Chameleons in a cage.

A Snuke Chameleon that has not eaten anything is blue. It changes its color according to the following rules:

* A Snuke Chameleon that is blue will change its color to red when the number of red balls it has eaten becomes strictly larger than the number of blue balls it has eaten.
* A Snuke Chameleon that is red will change its color to blue when the number of blue balls it has eaten becomes strictly larger than the number of red balls it has eaten.



Initially, every Snuke Chameleon had not eaten anything. Ringo fed them by repeating the following process K times:

* Grab either a red ball or a blue ball.
* Throw that ball into the cage. Then, one of the chameleons eats it.



After Ringo threw in K balls, all the chameleons were red. We are interested in the possible ways Ringo could have thrown in K balls. How many such ways are there? Find the count modulo 998244353. Here, two ways to throw in balls are considered different when there exists i such that the color of the ball that are thrown in the i-th throw is different.

Constraints

* 1 \leq N,K \leq 5 \times 10^5
* N and K are integers.

Input

Input is given from Standard Input in the following format:


N K


Output

Print the possible ways Ringo could have thrown in K balls, modulo 998244353.

Examples

Input

2 4


Output

7


Input

3 7


Output

57


Input

8 3


Output

0


Input

8 10


Output

46


Input

123456 234567


Output

857617983

Solution (in CPP):

Solution:
#include<cstdio>
#include<cstring>
#include<algorithm>
#define rep(i,a,b) for(i=a;i<=b;i++)
using namespace std;
const int N=500010,maxn=500000;
const int mod=998244353;
int inv[N],cj[N];int ans;

int power(int x,int y){
	int ret=1;
	for(;y;y>>=1,x=1ll*x*x%mod){
		if(y&1)	ret=1ll*ret*x%mod;
	}
	return ret;
}

void init(){
	int i;
	cj[0]=1;rep(i,1,maxn)	cj[i]=1ll*cj[i-1]*i%mod;
	inv[maxn]=power(cj[maxn],mod-2);inv[0]=1;
	for(i=maxn-1;i;i--)	inv[i]=1ll*inv[i+1]*(i+1)%mod;
}

inline int C(int n,int m){
	//printf("%d %d\n",n,m);
	if(m<0||n<m)	return 0;
	return 1ll*cj[n]*inv[m]%mod*inv[n-m]%mod;
}

int main(){
//	freopen("a.in","r",stdin);
//	freopen("a.out","w",stdout);
	int i,n,m;
	init();
	scanf("%d%d",&n,&m);
	rep(i,0,min(m/2-(m+1&1),m-n)){
		ans=(1ll*ans+C(m,i)-C(m,i-(m-i-n+1)))%mod;
		//if(2*i==m)	ans=(1ll*ans-(C(m-1,i-(m-i-n))-C(m-1,i-(m-i-n+1))))%mod;
		//printf("%d\n",ans);
	}
	i=m/2;
	if(2*i==m&&i<=m-n)	ans=(1ll*ans+C(m-1,i-1)-C(m-1,i-1-(m-i-n+1)))%mod;
	ans=(ans%mod+mod)%mod;
	printf("%d",ans);
}