from collections import defaultdict, deque

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

G = defaultdict(list)

for i in range(1, N):

    G[i].append(i+1)

    G[i+1].append(i)

#print(G)



G[X].append(Y)

G[Y].append(X)



#print(G)



d = [0] * N



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

    q = deque()

    q.append(i)

    visit = [-1]*N

    visit[i-1] = 0

    while q:

        p = q.popleft()

        for next_p in G[p]:

            if visit[next_p-1] == -1:

                visit[next_p-1] = visit[p-1] + 1

                q.append(next_p)



    for l in range(N):

        d[visit[l]] += 1



for k in range(1, N):

    print((d[k]//2))

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



d = [0] * N

for i in range(0, N-1):

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

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

        d[k] += 1



for i in range(1, N):

    print((d[i]))

from collections import defaultdict, deque

N, X, Y = list(map(int, input().split()))
G = defaultdict(list)
for i in range(1, N):
    G[i].append(i + 1)
    G[i + 1].append(i)
# print(G)
G[X].append(Y)
G[Y].append(X)
# print(G)
d = [0] * N
for i in range(1, N + 1):
    q = deque()
    q.append(i)
    visit = [-1] * N
    visit[i - 1] = 0
    while q:
        p = q.popleft()
        for next_p in G[p]:
            if visit[next_p - 1] == -1:
                visit[next_p - 1] = visit[p - 1] + 1
                q.append(next_p)
    for l in range(N):
        d[visit[l]] += 1
for k in range(1, N):
    print((d[k] // 2))

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

-from collections import defaultdict, deque - -G = defaultdict(list) +d = [0] * N +for i in range(0, N - 1): +    for j in range(i + 1, N): +        k = min(j - i, abs(X - 1 - i) + 1 + abs(Y - 1 - j)) +        d[k] += 1 -    G[i].append(i + 1) -    G[i + 1].append(i) -# print(G) -G[X].append(Y) -G[Y].append(X) -# print(G) -d = [0] * N -for i in range(1, N + 1): -    q = deque() -    q.append(i) -    visit = [-1] * N -    visit[i - 1] = 0 -    while q: -        p = q.popleft() -        for next_p in G[p]: -            if visit[next_p - 1] == -1: -                visit[next_p - 1] = visit[p - 1] + 1 -                q.append(next_p) -    for l in range(N): -        d[visit[l]] += 1 -for k in range(1, N): -    print((d[k] // 2)) +    print((d[i]))