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: def isEnd(list):
      if (list[0] == 0) and (list[1] == 0):
          return True
      return False
  
  
  def answer(list):
      kumi = 0
      if list[1] < 6:
          return kumi
      for i in range(1, list[1] + 1):
          for j in range(i + 1, list[1] + 1):
              another = list[1] - i - j
              if (another > j) and (another <= list[0]):
                  kumi += 1
      return kumi
  
  
  flag = True
  a = []
  
  while flag:
      t = list(map(int, input().split()))
      if isEnd(t):
          flag = False
          continue
      a.append(t)
  
  for i in a:
      ans = answer(i)
      print(ans)
  
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"}]