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: x, n = tuple(int(i) for i in input().split())
  r = 0
  
  
  def transnum(int: n):
      if n % 3 != 0:
          return n + 3 - n % 3
      else:
          return n
  
  
  amin = n // 3 + 1
  amax = 2 * transnum(n) // 3
  if amax > x:
      amax = x
  
  A = [j for j in range(amin, amax + 1)]
  
  # print(A)
  
  for a in A:
      bmin = (n - a) // 3 + 1
      bmax = 2 * transnum(n - a) // 3
      if bmax > a:
          bmax = a
  
      B = [j for j in range(bmin, bmax) if j + j != n - a]
      # print(B)
      for b in B:
          cmin = (n - a - b) // 3 + 1
          cmax = 2 * transnum(n - a - b) // 3
          if cmax > b:
              cmax = b
          C = [k for k in range(cmin, cmax) if k == n - a - b]
          # print(C)
          r += len(C)
          C.clear()
      B.clear()
  
  print(r)
  
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"}]