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 = map(int, input().split())
  list = [i + 1 for i in range(N)]
  # 処理に用いる３つのリスト
  # 一つ目
  newlist1 = [i + 1 for i in range(X)]
  li_2 = [i + 1 for i in range(Y - 1, N)]
  newlist1.extend(li_2)
  # 二つ目
  newlist2 = [i + 1 for i in range(X)]
  li_3 = [i + 1 for i in range(X, Y)]
  newlist2.extend(li_3[::-1])
  # 三つ目
  newlist3 = [i + 1 for i in range(X - 1, Y - 1)][::-1]
  li_4 = [i + 1 for i in range(Y - 1, N)]
  newlist3.extend(li_4)
  # 探索済みレコード
  alreadyadded = []
  # 探索用コード
  for i in range(1, N):  # 間隔の設定
      counter = 0
      for j in range(0, N - i):
          if not set([list[j], list[j + i]]) in alreadyadded:
              alreadyadded.append(set([list[j], list[i + j]]))
              counter += 1
      for j in range(0, len(newlist1) - i):
          if not set([newlist1[j], newlist1[j + i]]) in alreadyadded:
              alreadyadded.append(set([newlist1[j], newlist1[i + j]]))
              counter += 1
      for j in range(0, len(newlist2) - i):
          if not set([newlist2[j], newlist2[j + i]]) in alreadyadded:
              alreadyadded.append(set([newlist2[j], newlist2[i + j]]))
              counter += 1
      for j in range(0, len(newlist3) - i):
          if not set([newlist3[j], newlist3[j + i]]) in alreadyadded:
              alreadyadded.append(set([newlist3[j], newlist3[i + j]]))
              counter += 1
      print(counter)
  
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"}]