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

x -= 1

y -= 1

GRAPH = [[0]*n for _ in range(n)]



def shortest_path(i, j):

    if i <= x <= y <= j:

        return min(j-i, x-i+j-y+1)

    elif x <= i <= y <= j:

        return min(j-i, i-x+j-y+1)

    elif x <= i <= j <= y:

        return min(j-i, i-x+y-j+1)

    elif i <= x <= j <= y:

        return min(j-i, x-i+y-j+1)

    else:

        return j-i





ans = [0]*(n-1)

for i in range(n):

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

        path = shortest_path(i, j)-1

        ans[path] += 1

print(*ans, sep="\n")

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

x -= 1

y -= 1

GRAPH = [[0]*n for _ in range(n)]



def shortest_path(i, j):

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



ans = [0]*(n-1)

for i in range(n):

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

        path = shortest_path(i, j)-1

        ans[path] += 1

print(*ans, sep="\n")

n, x, y = map(int, input().split())
x -= 1
y -= 1
GRAPH = [[0] * n for _ in range(n)]


def shortest_path(i, j):
    if i <= x <= y <= j:
        return min(j - i, x - i + j - y + 1)
    elif x <= i <= y <= j:
        return min(j - i, i - x + j - y + 1)
    elif x <= i <= j <= y:
        return min(j - i, i - x + y - j + 1)
    elif i <= x <= j <= y:
        return min(j - i, x - i + y - j + 1)
    else:
        return j - i


ans = [0] * (n - 1)
for i in range(n):
    for j in range(i + 1, n):
        path = shortest_path(i, j) - 1
        ans[path] += 1
print(*ans, sep="\n")

n, x, y = map(int, input().split())
x -= 1
y -= 1
GRAPH = [[0] * n for _ in range(n)]


def shortest_path(i, j):
    return min(j - i, abs(x - i) + abs(y - j) + 1)


ans = [0] * (n - 1)
for i in range(n):
    for j in range(i + 1, n):
        path = shortest_path(i, j) - 1
        ans[path] += 1
print(*ans, sep="\n")

-    if i <= x <= y <= j: -        return min(j - i, x - i + j - y + 1) -    elif x <= i <= y <= j: -        return min(j - i, i - x + j - y + 1) -    elif x <= i <= j <= y: -        return min(j - i, i - x + y - j + 1) -    elif i <= x <= j <= y: -        return min(j - i, x - i + y - j + 1) -    else: -        return j - i +    return min(j - i, abs(x - i) + abs(y - j) + 1)