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 Scala (judge verdict: Memory Limit Exceeded)

import scala.collection.mutable
import scala.io.StdIn

/**
  * AOJ
  */
object Main {

  def main(args: Array[String]): Unit = {

    while (true) {

      val in = StdIn.readLine().split(" ").map(_.toInt)
      if (in(0) == 0 && in(1) == 0) { return }

      val set = mutable.Set[Set[Int]]()
      for(i <- 1 to in(0); j <- 1 to in(0); k <- 1 to in(0)){
        if(Set(i,j,k).size == 3 && i + j + k == in(1)){
          set += Set(i,j,k)
        }
      }
      println(set.size)
    }
  }
}