Problem:
How many ways?

Write a program which identifies the number of combinations of three integers which satisfy the following conditions:

You should select three distinct integers from 1 to n.

A total sum of the three integers is x.

For example, there are two combinations for n = 5 and x = 9.

1 + 3 + 5 = 9

2 + 3 + 4 = 9

Input

The input consists of multiple datasets. For each dataset, two integers n and x are given in a line.

The input ends with two zeros for n and x respectively. Your program should not process for these terminal symbols.

Constraints

3 ≤ n ≤ 100

0 ≤ x ≤ 300

Output

For each dataset, print the number of combinations in a line.

Sample Input

5 9
0 0

Sample Output

2

Note

      解説

Solution in JAVA (judge verdict: Wrong Answer)

import java.util.Scanner;

class NumClass{
	public int max;
	public int sum;
}
	

class Main {
  public static void main(String args[]) {
	  	Scanner scanner = new Scanner(System.in);
	  	int i,j,k;
	  	int count;
	  	int c = 0;
	  	
	  	NumClass num = new NumClass();
	  	
	  	while(true){
	  		count = 0;
	  		num.max = scanner.nextInt();
	  		num.sum = scanner.nextInt();
		  	
		  	if(num.max == 0 && num.sum == 0)
		  		break;
		  	
		  	for(i = 1; i <= num.max - 2 ; i ++){
		  		for( j = i + 1; j <= num.max - 1; j ++ ){
		  			for(k = j + 1; k <= num.max ; k ++){
		  				if(i + j + k == num.sum) {
		  					count ++;
		  					if(i == k || j == k || i == j)
		  						count --;
		  				}
		  				c ++;
		  			}
		  		}
		  	}

			System.out.println(count);
			System.out.println(c);
	  		
	  	}
        scanner.close();
  }
}