n, x, y = list(map(int, input().split()))

x -= 1

y -= 1

ans_l = [0]*n

for i in range(n):

    for j in range(i, n):

        k = min(abs(j-i), abs(x-i)+1+abs(y-j), abs(x-j)+1+abs(y-i))

        ans_l[k] += 1

for ans in ans_l[1:]:

    print(ans)
n, x, y = list(map(int, input().split()))

x -= 1

y -= 1

ans_l = [0]*n



def min_dist(a,b):

    return min(b-a, abs(x-a)+1+abs(y-b), abs(x-b)+1+abs(y-a))

for i in range(n):

    for j in range(i, n):

        k = min_dist(i,j)

        ans_l[k] += 1

for ans in ans_l[1:]:

    print(ans)
n, x, y = list(map(int, input().split()))
x -= 1
y -= 1
ans_l = [0] * n
for i in range(n):
    for j in range(i, n):
        k = min(abs(j - i), abs(x - i) + 1 + abs(y - j), abs(x - j) + 1 + abs(y - i))
        ans_l[k] += 1
for ans in ans_l[1:]:
    print(ans)

n, x, y = list(map(int, input().split()))
x -= 1
y -= 1
ans_l = [0] * n


def min_dist(a, b):
    return min(b - a, abs(x - a) + 1 + abs(y - b), abs(x - b) + 1 + abs(y - a))


for i in range(n):
    for j in range(i, n):
        k = min_dist(i, j)
        ans_l[k] += 1
for ans in ans_l[1:]:
    print(ans)

+ + +def min_dist(a, b): +    return min(b - a, abs(x - a) + 1 + abs(y - b), abs(x - b) + 1 + abs(y - a)) + + -        k = min(abs(j - i), abs(x - i) + 1 + abs(y - j), abs(x - j) + 1 + abs(y - i)) +        k = min_dist(i, j)