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: N, X, Y = [int(e) for e in input().split(" ")]
  
  a = X - 1
  b = N - Y
  c = Y - X + 1
  
  for k in range(1, N):
      # print('--k={}--'.format(k))
      ans = 0
      # A
      if a < k:
          pass
      else:
          ans += a - k + 1
      # print('a')
      # print(ans)
      # B
      if b < k:
          pass
      else:
          ans += b - k + 1
      # print('b')
      # print(ans)
      # c
      if c / 2 < k:
          pass
      elif c % 2 == 0 and c // 2 == k:
          ans += c // 2
      else:
          ans += c
      # print('c')
      # print(ans)
      # ABC
      if a != 0 and b != 0 and 3 <= k <= a + b + 1:
          suba = (k - 3) - (a - 1) if (k - 3) - (a - 1) > 0 else 0
          subb = (k - 3) - (b - 1) if (k - 3) - (b - 1) > 0 else 0
          ans += k - 2 - suba - subb
      # print('abc')
      # print(ans)
      # AC
      if a != 0 and 2 <= k <= a + c // 2:
          aa = a - 1
          cc = c // 2
          suba = (k - 2) - (aa) if (k - 2) - (aa) > 0 else 0
          subc = (k - 1) - (cc) if (k - 1) - (cc) > 0 else 0
          ans += (k - 1 - suba - subc) * 2
          # print('suba={},subc={},{}'.format(suba,subc,k-c//2))
          if c % 2 == 0 and 0 < k - c // 2:
              ans -= 1
  
      # print('ac')
      # print(ans)
      # print(suba)
      # print(subc)
      # BC
      if b != 0 and 2 <= k <= b + c // 2:
          bb = b - 1
          cc = c // 2
          subb = (k - 2) - (bb) if (k - 2) - (bb) > 0 else 0
          subc = (k - 1) - (cc) if (k - 1) - (cc) > 0 else 0
          ans += (k - 1 - subb - subc) * 2
  
          if c % 2 == 0 and 0 < k - c // 2:
              ans -= 1
      # print('bc')
      # print(ans)
      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"}]