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



X -= 1

Y -= 1

distances = [0]*N

for i in range(N):

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

        d = min(abs(j-i), abs(X-i)+1+abs(j-Y), abs(Y-i)+1+abs(j-X))

        distances[d] += 1



for i in range(1,N):

    print((distances[i]))
N, X, Y = list(map(int, input().split()))



X -= 1

Y -= 1

distances = [0]*N

for i in range(N):

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

        # d = min(abs(j-i), abs(X-i)+1+abs(j-Y), abs(Y-i)+1+abs(j-X))

        d = min(abs(j-i), abs(X-i)+1+abs(j-Y))

        distances[d] += 1



for i in range(1,N):

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

N, X, Y = list(map(int, input().split()))
X -= 1
Y -= 1
distances = [0] * N
for i in range(N):
    for j in range(i + 1, N):
        # d = min(abs(j-i), abs(X-i)+1+abs(j-Y), abs(Y-i)+1+abs(j-X))
        d = min(abs(j - i), abs(X - i) + 1 + abs(j - Y))
        distances[d] += 1
for i in range(1, N):
    print((distances[i]))

-        d = min(abs(j - i), abs(X - i) + 1 + abs(j - Y), abs(Y - i) + 1 + abs(j - X)) +        # d = min(abs(j-i), abs(X-i)+1+abs(j-Y), abs(Y-i)+1+abs(j-X)) +        d = min(abs(j - i), abs(X - i) + 1 + abs(j - Y))