output_description: For each k=1, 2, ..., N-1 in this order, print a line containing the answer to
  the problem.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N X Y
attempt: # import math
  # import sys
  # A, B = [int(i) for i in input().split()]
  # for i in range(math.ceil(12.5 * A), math.ceil(12.5 * (A + 1))):
  #     if math.floor(i//10) == B:
  #         print(i)
  #         sys.exit()
  # print(-1)
  
  # x = int(input())
  # s, a = divmod(x, 500)
  # print(s*1000 + (a // 5)*5)
  
  # k, n = [int(i) for i in input().split()]
  # a = [int(i) for i in input().split()]
  # maxx = 0
  # key = 0
  # for i in range(0, n):
  #   if i == n-1:
  #     key = (k + a[0]) - a[i]
  #   else:
  #     key = a[i+1] - a[i]
  #   if maxx < key:
  #     maxx = key
  # print(k - maxx)
  
  n, x, y = [int(i) for i in input().split()]
  p = y - x + 1
  a = x - 1
  b = n - y
  print(n)
  ans2 = n - (y - x) + 1
  if 2 < p / 2:
      ans2 += p
  elif 2 == 2 / p:
      ans2 += 2
  print(ans2)
  for k in range(3, n):
      ans = 0
      main = 0
      eda1 = 0
      eda2 = 0
      if p % 2 == 1:
          if k <= p // 2:
              main = n - (y - x) - k + 1
              eda1 = min(a, (k - 1)) * 2
              eda2 = min(b, (k - 1)) * 2
              ans = p + main + eda1 + eda2
          else:
              main = n - (y - x) - k + 1
              if k - (p // 2) > a:
                  eda1 = 0
              else:
                  eda1 = min(a - (k - (p // 2)) + 1, k - (p // 2) + 1) * 2
              if k - (p // 2) > b:
                  eda2 = 0
              else:
                  eda2 = min(b - (k - (p // 2)) + 1, k - (p // 2) + 1) * 2
              ans = main + eda1 + eda2 - 2
      else:
          if k < p // 2:
              main = n - (y - x) - k + 1
              eda1 = min(a, (k - 1)) * 2
              eda2 = min(b, (k - 1)) * 2
              ans = p + main + eda1 + eda2
          elif k == p // 2:
              main = n - (y - x) - k + 1
              if k - (p // 2) > a:
                  eda1 = 0
              else:
                  eda1 = min(a - (k - (p // 2)) + 1, k - (p // 2) + 1) * 2
              if k - (p // 2) > b:
                  eda2 = 0
              else:
                  eda2 = min(b - (k - (p // 2)) + 1, k - (p // 2) + 1) * 2
              ans = p // 2 + main + eda1 + eda2 - 2
          else:
              main = n - (y - x) - k + 1
              if k - (p // 2) > a:
                  eda1 = 0
              else:
                  eda1 = min(a - (k - (p // 2)) + 1, k - (p // 2) + 1) * 2
              if k - (p // 2) > b:
                  eda2 = 0
              else:
                  eda2 = min(b - (k - (p // 2)) + 1, k - (p // 2) + 1) * 2
              ans = main + eda1 + eda2 - 2
  print(ans)
  
problem_description: Statement
  
  We have an undirected graph G with N vertices numbered 1 to N and N edges as
  follows:
  
    * For each i=1,2,...,N-1, there is an edge between Vertex i and Vertex i+1.
    * There is an edge between Vertex X and Vertex Y.
  
  For each k=1,2,...,N-1, solve the problem below:
  
    * Find the number of pairs of integers (i,j) (1 \leq i < j \leq N) such that the shortest distance between Vertex i and Vertex j in G is k.
samples: [{"input": "5 2 4", "output": "5\n    4\n    1\n    0\n    \n\nThe graph in this input is as follows:  \n  \n![Figure](https://img.atcoder.jp/ghi/3ae0885a4aeda99694b9fde4efe39dc1.png)  \n  \nThere are five pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest\ndistance between Vertex i and Vertex j is 1:\n(1,2)\\,,(2,3)\\,,(2,4)\\,,(3,4)\\,,(4,5).  \nThere are four pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest\ndistance between Vertex i and Vertex j is 2: (1,3)\\,,(1,4)\\,,(2,5)\\,,(3,5).  \nThere is one pair (i,j) (1 \\leq i < j \\leq N) such that the shortest distance\nbetween Vertex i and Vertex j is 3: (1,5).  \nThere are no pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest distance\nbetween Vertex i and Vertex j is 4.\n\n* * *"}, {"input": "3 1 3", "output": "3\n    0\n    \n\nThe graph in this input is as follows:  \n  \n![Figure](https://img.atcoder.jp/ghi/be2921b3b307fc993a390a59437e624e.png)  \n  \n\n* * *"}, {"input": "7 3 7", "output": "7\n    8\n    4\n    2\n    0\n    0\n    \n\n* * *"}, {"input": "10 4 8", "output": "10\n    12\n    10\n    8\n    4\n    1\n    0\n    0\n    0"}]