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

k_list = [0]*N



for p in range(1, N):

    for q in range(p, N+1):

        p2X = abs(p - X)

        p2Y = abs(p - Y)

        q2X = abs(q - X)

        q2Y = abs(q - Y)



        distance = min(q-p, p2X+1+q2Y)

        k_list[distance] += 1



for k in range(1, N):

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

k_list = [0]*N



for p in range(1, N):

    for q in range(p, N+1):

        p2X = abs(p - X)

        q2Y = abs(q - Y)



        distance = min(q-p, p2X+1+q2Y)

        k_list[distance] += 1



for k in range(1, N):

    print((k_list[k]))
N, X, Y = list(map(int, input().split()))
k_list = [0] * N
for p in range(1, N):
    for q in range(p, N + 1):
        p2X = abs(p - X)
        p2Y = abs(p - Y)
        q2X = abs(q - X)
        q2Y = abs(q - Y)
        distance = min(q - p, p2X + 1 + q2Y)
        k_list[distance] += 1
for k in range(1, N):
    print((k_list[k]))

N, X, Y = list(map(int, input().split()))
k_list = [0] * N
for p in range(1, N):
    for q in range(p, N + 1):
        p2X = abs(p - X)
        q2Y = abs(q - Y)
        distance = min(q - p, p2X + 1 + q2Y)
        k_list[distance] += 1
for k in range(1, N):
    print((k_list[k]))

-        p2Y = abs(p - Y) -        q2X = abs(q - X)