You are given two integers K and S.
Three variable X, Y and Z takes integer values satisfying 0≤X,Y,Z≤K.
How many different assignments of values to X, Y and Z are there such that X + Y + Z = S?

Constraints

* 2≤K≤2500
* 0≤S≤3K
* K and S are integers.

Input

The input is given from Standard Input in the following format:


K S


Output

Print the number of the triples of X, Y and Z that satisfy the condition.

Examples

Input

2 2


Output

6


Input

5 15


Output

1
import java.util.*;

public class Main {

	public static void main(String[] args) {
		Scanner sc=new Scanner(System.in);
int k=sc.nextInt();
int s=sc.nextInt();
int x=0;
int count=0;
int y=0;int z=0;
Set<Integer> al=new HashSet<>();
for(int i=0;i<=k;i++) {
	al.add(i);
}
for(int i=0;i<=k;i++) {
	for(int j=0;j<=k;j++) {
	
			if(al.contains(s-i-j)) {
				count++;
			}
		
}
}
System.out.println(count);
	}

}
