output_description: For each dataset, print the number of combinations in a line.
input_description: 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.
attempt: while True:
      a = input().split(" ")
      b = 0
      s = []
      c = [number + 1 for number in range(int(a[0]))]
      for i in c:
          for e in c:
              for f in c:
                  if i + e + f == int(a[1]) and not (i * e * f in s):
                      if not (i == e or e == f or f == i):
                          s.append(i * e * f)
                          b += 1
      print(b)
  
problem_description: 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
samples: [{"input": "9\n    0 0", "output": "## Note\n\n      \u89e3\u8aac"}]