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



def dist(fr, to):

    return min(

        to - fr,

        abs(to - Y) + 1 + abs(fr - X),

        abs(fr - Y) + 1 + abs(to - X)

    )



cnt = [0] * N



ans = 0

for fr in range(1, N + 1):

    for to in range(fr + 1, N + 1):

        cnt[dist(fr, to)] += 1



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

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

ans = [0] * N



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

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

        d = min(

            j - i,

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

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

        )

        ans[d] += 1



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

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


def dist(fr, to):
    return min(to - fr, abs(to - Y) + 1 + abs(fr - X), abs(fr - Y) + 1 + abs(to - X))


cnt = [0] * N
ans = 0
for fr in range(1, N + 1):
    for to in range(fr + 1, N + 1):
        cnt[dist(fr, to)] += 1
print(*(cnt[1:]), sep="\n")

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

- - -def dist(fr, to): -    return min(to - fr, abs(to - Y) + 1 + abs(fr - X), abs(fr - Y) + 1 + abs(to - X)) - - -cnt = [0] * N -ans = 0 -for fr in range(1, N + 1): -    for to in range(fr + 1, N + 1): -        cnt[dist(fr, to)] += 1 -print(*(cnt[1:]), sep="\n") +ans = [0] * N +for i in range(1, N + 1): +    for j in range(i + 1, N + 1): +        d = min(j - i, abs(i - X) + 1 + abs(j - Y), abs(j - X) + 1 + abs(i - Y)) +        ans[d] += 1 +print(*ans[1:], sep="\n")