import queue

def main():

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

    x -= 1

    y -= 1

    ans = [0]*n

    t = [[i+1, i-1] for i in range(n)]

    t[x].append(y)

    t[y].append(x)

    for i in range(n):

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

            if j <= x:

                ans[j-i] += 1

            elif j <= y:

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

                ans[buf] += 1

            else:

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

                ans[buf + (j-y)] += 1

    for i in range(1, n):

        print((ans[i]))

if __name__ == "__main__":

    main()
def main():

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

    ans = [0]*(n)

    for i in range(1, n):

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

            ans[min(j-i, abs(x-i)+abs(y-j)+1)] += 1

    for v in ans[1:]:

        print(v)



if __name__ == "__main__":

    main()

import queue


def main():
    n, x, y = list(map(int, input().split()))
    x -= 1
    y -= 1
    ans = [0] * n
    t = [[i + 1, i - 1] for i in range(n)]
    t[x].append(y)
    t[y].append(x)
    for i in range(n):
        for j in range(i + 1, n):
            if j <= x:
                ans[j - i] += 1
            elif j <= y:
                buf = min(j - i, abs(i - x) + 1 + (y - j))
                ans[buf] += 1
            else:
                buf = min(y - i, abs(x - i) + 1)
                ans[buf + (j - y)] += 1
    for i in range(1, n):
        print((ans[i]))


if __name__ == "__main__":
    main()

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


if __name__ == "__main__":
    main()

-import queue - - -    x -= 1 -    y -= 1 -    ans = [0] * n -    t = [[i + 1, i - 1] for i in range(n)] -    t[x].append(y) -    t[y].append(x) -    for i in range(n): -        for j in range(i + 1, n): -            if j <= x: -                ans[j - i] += 1 -            elif j <= y: -                buf = min(j - i, abs(i - x) + 1 + (y - j)) -                ans[buf] += 1 -            else: -                buf = min(y - i, abs(x - i) + 1) -                ans[buf + (j - y)] += 1 +    ans = [0] * (n) -        print((ans[i])) +        for j in range(i + 1, n + 1): +            ans[min(j - i, abs(x - i) + abs(y - j) + 1)] += 1 +    for v in ans[1:]: +        print(v)