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())
  X, Y = X - 1, Y - 1
  ans = [0] * (N + 1)
  
  
  def search(s):
      global tmp, ans
      tmp[s] = 0
      Next = [s + 1]
      Vec = [1]
      if s == X:
          Next.extend([Y, Y])
          Vec.extend([1, -1])
      elif X < s < Y:
          Next.append(s - 1)
          Vec.append(-1)
      subsearch(Next, Vec, s, 1)
      for t in tmp[s:]:
          ans[t] += 1
  
  
  def subsearch(Now, Vecnow, s, dis):
      if Now == []:
          return
      global tmp
      Next = []
      Vec = []
      before = -1
      for n, v in zip(Now, Vecnow):
          if n >= N:
              continue
  
          if tmp[n] == -1:
              tmp[n] = dis
              Next.append(n + v)
              Vec.append(v)
              if n == X:
                  Next.extend([Y, Y])
                  Vec.extend([1, -1])
              before = n
          elif before == n:
              tmp[n] = min(dis, tmp[n])
              Next.append(n + v)
              Vec.append(v)
          else:
              tmp[n] = min(dis, tmp[n])
      subsearch(Next, Vec, s, dis + 1)
  
  
  for i in range(N - 1):
      tmp = [-1] * N
      search(i)
  
  for a in ans[1:-1]:
      print(a)
  
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"}]