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: WA: Presentation Error)


import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main {

    public static void main(String[] args) throws IOException {
        BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
        StringBuilder builder = new StringBuilder();
        String[] columns;
        int a1 = 0;
        int a2 = 0;
        int res = 0;

        while (true) {
            String line = reader.readLine();
            columns = line.split(" ");
            a1 = Integer.parseInt(columns[0]);
            a2 = Integer.parseInt(columns[1]);
            if (a1 == 0 && a2 == 0) {
                break;
            }

            res = pattern(a1, a2);
            builder.append(res)
                   .append("\n");
        }
        System.out.println(builder);
    }

    public static int pattern(int a1, int a2) {
        int list = 0;
        for (int x = 1; x <= a1; x++) {
            for (int y = x + 1; y <= a1 ; y++) {
                for (int z = y + 1; z <= a1; z++) {
                    if (x + y + z == a2) {
                        list += 1;
                    }
                }
            }
        }
        return list;
    }
}