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: ii = lambda: int(input())
  mi = lambda: map(int, input().split())
  li = lambda: list(map(int, input().split()))
  n, x, y = mi()
  dist = y - x
  hh = x
  th = n - y + 1
  # print(hh,th,dist)
  for k in range(1, n):
      # hh
      a = 0 if hh < k else hh - k
      # th
      b = 0 if th < k else th - k
      # hh-c
      c = min((k - 1) * 2, dist) - min(max(0, (k - hh) * 2), dist)
      # th-c
      d = min((k - 1) * 2, dist) - min(max(0, (k - th) * 2), dist)
      # hh-th
      if hh + th - 1 < k:
          e = 0
      elif k > 2:
          e = min(k - 2, hh - 1, th - 1)
      else:
          e = 0
  
      # c
      if k > ((dist + 1) / 2):
          f = 0
      else:
          f = dist + 1
  
      # print(k,a,b,c,d,e,f)
      print(a + b + c + d + e + f)
  
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"}]