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 Main {

	public static void main(String[] args) {

		int n, x;
		int i = 0, j = 0, k = 0;
		int count = 0;
		Scanner stdIn = new Scanner(System.in);

		boolean flag = true;
		while (flag) {
			n = stdIn.nextInt();
			x = stdIn.nextInt();

			if (n == 0 && x == 0) {
				flag = false;
				break;
			}

			count = 0;
			for (i = 1; i < n; i++) {
				for (j = i + 1; j < n; j++) {
					for (k = x - i - j; k > j; k--) {
						System.out.print(i + " " + j + " " + k);
						if (x == i + j + k && k <= n) {
							System.out.println(" count ");
							count++;
						} else {
							System.out.println();
						}
					}
				}

			}
			System.out.println(count);
		}
		stdIn.close();
	}
}