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


def g(s, k):
	if s < 0: return 0
	if s == 0: return 1
	if k <=s <= 2*k: 
		return k - (s - k) +1
		return k +1
	if s < k: return s + 1
	if s > 2*k: return 0 

def f(s,k):
	ans = 0
	for c in range(k+1): 
		ans += g(s - c,k)
	return ans
k,s = map(int, raw_input().split())
print f(s,k)