import copy



N, X, Y = list(map(int, input().split()))

def check(num, distance):

    if num!=0:

        distance[num-1]=min(distance[num]+1, distance[num-1])

    if num!=N-1:

        distance[num+1]=min(distance[num+1], distance[num]+1)

    if num==X-1:

        distance[Y-1]=min(distance[Y-1], distance[X-1]+1)

    elif num==Y-1:

        distance[X-1] = min(distance[X-1], distance[Y-1]+1)

total_answer=[]

answer=[N]*N

for k in range(N):

    temp=copy.copy(answer)

    temp[k]=0

    #print(temp)

    for i in range(0, N):

        check(i, temp)

        #print(temp)

    #print(temp)

    for j in range(N-1,-1,-1):

        check(j, temp)

    #print(temp)

    #print('/n')



    for i in range(0, N):

        check(i, temp)



    for j in range(N - 1, -1, -1):

        check(j, temp)

    for i in range(0, N):

        check(i, temp)



    for j in range(N - 1, -1, -1):

        check(j, temp)



        #print(temp)

    #print(temp)

    total_answer+=temp

#print(total_answer)

import collections

dict=collections.Counter(total_answer)

#print(dict)

for i in range(1, N):

    print((dict[i]//2))
N, X, Y=list(map(int, input().split()))



answer=[0]*(N-1)

#i, j from 1 to N

for i in range(1, N):

    for j in range(i+1, N+1):

        temp=min(abs(j-i), abs(j-Y)+1+abs(X-i)) #, abs(j-X)+1+abs(Y-i)

        #print(i, j, temp)

        answer[temp-1]+=1

for val in answer:

    print(val)
import copy

N, X, Y = list(map(int, input().split()))


def check(num, distance):
    if num != 0:
        distance[num - 1] = min(distance[num] + 1, distance[num - 1])
    if num != N - 1:
        distance[num + 1] = min(distance[num + 1], distance[num] + 1)
    if num == X - 1:
        distance[Y - 1] = min(distance[Y - 1], distance[X - 1] + 1)
    elif num == Y - 1:
        distance[X - 1] = min(distance[X - 1], distance[Y - 1] + 1)


total_answer = []
answer = [N] * N
for k in range(N):
    temp = copy.copy(answer)
    temp[k] = 0
    # print(temp)
    for i in range(0, N):
        check(i, temp)
        # print(temp)
    # print(temp)
    for j in range(N - 1, -1, -1):
        check(j, temp)
    # print(temp)
    # print('/n')
    for i in range(0, N):
        check(i, temp)
    for j in range(N - 1, -1, -1):
        check(j, temp)
    for i in range(0, N):
        check(i, temp)
    for j in range(N - 1, -1, -1):
        check(j, temp)
        # print(temp)
    # print(temp)
    total_answer += temp
# print(total_answer)
import collections

dict = collections.Counter(total_answer)
# print(dict)
for i in range(1, N):
    print((dict[i] // 2))

N, X, Y = list(map(int, input().split()))
answer = [0] * (N - 1)
# i, j from 1 to N
for i in range(1, N):
    for j in range(i + 1, N + 1):
        temp = min(abs(j - i), abs(j - Y) + 1 + abs(X - i))  # , abs(j-X)+1+abs(Y-i)
        # print(i, j, temp)
        answer[temp - 1] += 1
for val in answer:
    print(val)

-import copy - - - -def check(num, distance): -    if num != 0: -        distance[num - 1] = min(distance[num] + 1, distance[num - 1]) -    if num != N - 1: -        distance[num + 1] = min(distance[num + 1], distance[num] + 1) -    if num == X - 1: -        distance[Y - 1] = min(distance[Y - 1], distance[X - 1] + 1) -    elif num == Y - 1: -        distance[X - 1] = min(distance[X - 1], distance[Y - 1] + 1) - - -total_answer = [] -answer = [N] * N -for k in range(N): -    temp = copy.copy(answer) -    temp[k] = 0 -    # print(temp) -    for i in range(0, N): -        check(i, temp) -        # print(temp) -    # print(temp) -    for j in range(N - 1, -1, -1): -        check(j, temp) -    # print(temp) -    # print('/n') -    for i in range(0, N): -        check(i, temp) -    for j in range(N - 1, -1, -1): -        check(j, temp) -    for i in range(0, N): -        check(i, temp) -    for j in range(N - 1, -1, -1): -        check(j, temp) -        # print(temp) -    # print(temp) -    total_answer += temp -# print(total_answer) -import collections - -dict = collections.Counter(total_answer) -# print(dict) +answer = [0] * (N - 1) +# i, j from 1 to N -    print((dict[i] // 2)) +    for j in range(i + 1, N + 1): +        temp = min(abs(j - i), abs(j - Y) + 1 + abs(X - i))  # , abs(j-X)+1+abs(Y-i) +        # print(i, j, temp) +        answer[temp - 1] += 1 +for val in answer: +    print(val)