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{
	static Scanner s = new Scanner(System.in);
	public static void main(String[] args){
		int k=s.nextInt(),SUM=s.nextInt(),sum=0;
		for(int a=0;a<=k;a++)if(a<=SUM)
				for(int b=0;b<=k;b++)
					if(SUM-a-b>=0 && SUM-a-b<=k)
						sum++;
		System.out.println(sum);
	}
}