def dist(a, b):

    return min(

        abs(a - b),

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

        abs(a - y) + 1 + abs(x - b)

    )





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

x -= 1

y -= 1



d = [0] * n



for j in range(n):

    for i in range(j):

        d[dist(i, j)] += 1



it = iter(d)

next(it)



print(*it, sep='\n')

def main():

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

    X -= 1

    Y -= 1



    ans = [0] * N

    for j in range(N):

        for i in range(j):

            d = min(

                j - i,

                abs(j - X) + 1 + abs(Y - i),

                abs(j - Y) + 1 + abs(X - i)

            )

            ans[d] += 1



    print(*ans[1:], sep='\n')





if __name__ == '__main__':

    main()

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


n, x, y = map(int, input().split())
x -= 1
y -= 1
d = [0] * n
for j in range(n):
    for i in range(j):
        d[dist(i, j)] += 1
it = iter(d)
next(it)
print(*it, sep="\n")

def main():
    N, X, Y = map(int, input().split())
    X -= 1
    Y -= 1
    ans = [0] * N
    for j in range(N):
        for i in range(j):
            d = min(j - i, abs(j - X) + 1 + abs(Y - i), abs(j - Y) + 1 + abs(X - i))
            ans[d] += 1
    print(*ans[1:], sep="\n")


if __name__ == "__main__":
    main()

-def dist(a, b): -    return min(abs(a - b), abs(a - x) + 1 + abs(y - b), abs(a - y) + 1 + abs(x - b)) +def main(): +    N, X, Y = map(int, input().split()) +    X -= 1 +    Y -= 1 +    ans = [0] * N +    for j in range(N): +        for i in range(j): +            d = min(j - i, abs(j - X) + 1 + abs(Y - i), abs(j - Y) + 1 + abs(X - i)) +            ans[d] += 1 +    print(*ans[1:], sep="\n") -n, x, y = map(int, input().split()) -x -= 1 -y -= 1 -d = [0] * n -for j in range(n): -    for i in range(j): -        d[dist(i, j)] += 1 -it = iter(d) -next(it) -print(*it, sep="\n") +if __name__ == "__main__": +    main()