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.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.Scanner;
import java.util.concurrent.atomic.AtomicInteger;
import java.util.stream.Collectors;
import java.util.stream.IntStream;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        Integer a = scanner.nextInt();
        Integer b = scanner.nextInt();

        AtomicInteger count = new AtomicInteger(0);
        List<String> used = new ArrayList<>();
        IntStream.range(1, a + 1)
                 .forEach(x -> {
            IntStream.range(1, a + 1)
                     .filter(y -> y != x)
                     .forEach(y -> {
                IntStream.range(1, a + 1)
                         .filter(z -> z != x && z != y)
                         .filter(z -> x + y + z == b)
                         .forEach(z -> {
                    String sorted = Arrays.asList(x, y, z)
                                          .stream()
                                          .sorted()
                                          .collect(Collectors.toList())
                                          .toString();
                    if (used.contains(sorted)) {
                        return;
                    }
                    used.add(sorted);
                    count.getAndAdd(1);
                });
            });
        });
        System.out.println(count.get());
    }
}