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

def shortest(x,y,a,b):

    ans=min(y-x,abs(y-b)+1+abs(a-x),abs(y-a)+1+abs(b-x))

    return ans

distance=[0]*N

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

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

        if y<=x:

            continue

        else:

            a=shortest(x,y,X,Y)

            distance[a-1]+=1

for i in range(N-1):

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

def shortest(x,y,a,b):

    ans=min(y-x,abs(y-b)+1+abs(a-x))

    return ans

distance=[0]*(N-1)

for x in range(1,N):

    for y in range(2,N+1):

        if y<=x:

            continue

        a=shortest(x,y,X,Y)

        distance[a-1]+=1

for i in distance:

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


def shortest(x, y, a, b):
    ans = min(y - x, abs(y - b) + 1 + abs(a - x), abs(y - a) + 1 + abs(b - x))
    return ans


distance = [0] * N
for x in range(1, N + 1):
    for y in range(1, N + 1):
        if y <= x:
            continue
        else:
            a = shortest(x, y, X, Y)
            distance[a - 1] += 1
for i in range(N - 1):
    print((distance[i]))

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


def shortest(x, y, a, b):
    ans = min(y - x, abs(y - b) + 1 + abs(a - x))
    return ans


distance = [0] * (N - 1)
for x in range(1, N):
    for y in range(2, N + 1):
        if y <= x:
            continue
        a = shortest(x, y, X, Y)
        distance[a - 1] += 1
for i in distance:
    print(i)

-    ans = min(y - x, abs(y - b) + 1 + abs(a - x), abs(y - a) + 1 + abs(b - x)) +    ans = min(y - x, abs(y - b) + 1 + abs(a - x)) -distance = [0] * N -for x in range(1, N + 1): -    for y in range(1, N + 1): +distance = [0] * (N - 1) +for x in range(1, N): +    for y in range(2, N + 1): -        else: -            a = shortest(x, y, X, Y) -            distance[a - 1] += 1 -for i in range(N - 1): -    print((distance[i])) +        a = shortest(x, y, X, Y) +        distance[a - 1] += 1 +for i in distance: +    print(i)