from numba import njit,prange





@njit(cache=True,parallel=True)

def solve(n,x,y):

    ans = [0] * (n - 1)

    for i in prange(n):

        for j in prange(n):

            c = min(abs(i - j), abs(i-x)+abs(j-y)+1,abs(i-y)+abs(j-x)+1)

            if c:

                ans[c-1] += 1

    return ans





n, x, y = list(map(int, input().split()))

x -= 1

y -= 1

ans = solve(n,x,y)

for ai in ans:

    print((ai//2))

from numba import njit





@njit(cache=True)

def solve(n,x,y):

    ans = [0] * (n - 1)

    for i in range(n):

        for j in range(n):

            c = min(abs(i - j), abs(i-x)+abs(j-y)+1,abs(i-y)+abs(j-x)+1)

            if c:

                ans[c-1] += 1

    return ans





n, x, y = list(map(int, input().split()))

x -= 1

y -= 1

ans = solve(n,x,y)

for ai in ans:

    print((ai//2))

from numba import njit, prange


@njit(cache=True, parallel=True)
def solve(n, x, y):
    ans = [0] * (n - 1)
    for i in prange(n):
        for j in prange(n):
            c = min(
                abs(i - j), abs(i - x) + abs(j - y) + 1, abs(i - y) + abs(j - x) + 1
            )
            if c:
                ans[c - 1] += 1
    return ans


n, x, y = list(map(int, input().split()))
x -= 1
y -= 1
ans = solve(n, x, y)
for ai in ans:
    print((ai // 2))

from numba import njit


@njit(cache=True)
def solve(n, x, y):
    ans = [0] * (n - 1)
    for i in range(n):
        for j in range(n):
            c = min(
                abs(i - j), abs(i - x) + abs(j - y) + 1, abs(i - y) + abs(j - x) + 1
            )
            if c:
                ans[c - 1] += 1
    return ans


n, x, y = list(map(int, input().split()))
x -= 1
y -= 1
ans = solve(n, x, y)
for ai in ans:
    print((ai // 2))

-from numba import njit, prange +from numba import njit -@njit(cache=True, parallel=True) +@njit(cache=True) -    for i in prange(n): -        for j in prange(n): +    for i in range(n): +        for j in range(n):