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
public class Main {public static void main(String[] args) {java.util.Scanner c=new java.util.Scanner(System.in);int k=c.nextInt(),s=c.nextInt();System.out.println(java.util.stream.IntStream.range(0,k+1).map(x->s-x+1-Math.min(s-x+1,Math.max(0,(s-x-k)*2))).sum());}}