import sys, re, os

from collections import deque, defaultdict, Counter

from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians

from itertools import permutations, combinations, product, accumulate

from operator import itemgetter, mul

from copy import deepcopy

from string import ascii_lowercase, ascii_uppercase, digits

from fractions import gcd

from heapq import heappop, heappush, heapify

 

def input(): return sys.stdin.readline().strip()

def INT(): return int(eval(input()))

def MAP(): return list(map(int, input().split()))

def S_MAP(): return list(map(str, input().split()))

def LIST(): return list(map(int, input().split()))

def S_LIST(): return list(map(str, input().split()))

 

sys.setrecursionlimit(10 ** 9)

INF = float('inf')

mod = 10 ** 9 + 7

 

def dijkstra(E, start):

    N_d = len(E)

    dist = [INF] * N_d

    dist[start] = 0

    q = [(0, start)]

    while q:

        dist_v, v = heappop(q)

        if dist[v] != dist_v:

            continue

        for u, dist_vu in E[v]:

            dist_u = dist_v + dist_vu

            if dist_u < dist[u]:

                dist[u] = dist_u

                heappush(q, (dist_u, u))

    return dist

 

N, X, Y = MAP()

 

graph = defaultdict(list)

 

for i in range(N-1):

    graph[i].append((i+1, 1))

    graph[i+1].append((i, 1))

 

graph[X-1].append((Y-1, 1))

graph[Y-1].append((X-1, 1))

 

a = dijkstra(graph, 0)

count = defaultdict(int)

for i in range(N):

    a = dijkstra(graph, i)

    

    # print(a[i+1:])

    for c in a[i+1:]:

        count[c] += 1

# print(count)

 

for i in range(1, N):

    print((count[i]))
import sys, re, os

from collections import deque, defaultdict, Counter

from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians

from itertools import permutations, combinations, product, accumulate

from operator import itemgetter, mul

from copy import deepcopy

from string import ascii_lowercase, ascii_uppercase, digits

from fractions import gcd

 

def input(): return sys.stdin.readline().strip()

def INT(): return int(eval(input()))

def MAP(): return list(map(int, input().split()))

def S_MAP(): return list(map(str, input().split()))

def LIST(): return list(map(int, input().split()))

def S_LIST(): return list(map(str, input().split()))

 

sys.setrecursionlimit(10 ** 9)

INF = float('inf')

mod = 10 ** 9 + 7



N, X, Y = MAP()

graph = [[] for i in range(N)]



for i in range(N-1):

    graph[i].append(i+1)

    graph[i+1].append(i)



graph[X-1].append(Y-1)

graph[Y-1].append(X-1)



dic = defaultdict(int)



for i in range(N):

    q = deque()

    q.append(i)

    dist = [INF] * N

    dist[i] = 0

    while q:

        n = q.popleft()

        for node in graph[n]:

            if dist[node] == INF:

                dist[node] = dist[n] + 1

                q.append(node)

        

    for d in dist:

        dic[d] += 1



for k in range(1, N):

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

import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
from heapq import heappop, heappush, heapify


def input():
    return sys.stdin.readline().strip()


def INT():
    return int(eval(input()))


def MAP():
    return list(map(int, input().split()))


def S_MAP():
    return list(map(str, input().split()))


def LIST():
    return list(map(int, input().split()))


def S_LIST():
    return list(map(str, input().split()))


sys.setrecursionlimit(10**9)
INF = float("inf")
mod = 10**9 + 7


def dijkstra(E, start):
    N_d = len(E)
    dist = [INF] * N_d
    dist[start] = 0
    q = [(0, start)]
    while q:
        dist_v, v = heappop(q)
        if dist[v] != dist_v:
            continue
        for u, dist_vu in E[v]:
            dist_u = dist_v + dist_vu
            if dist_u < dist[u]:
                dist[u] = dist_u
                heappush(q, (dist_u, u))
    return dist


N, X, Y = MAP()
graph = defaultdict(list)
for i in range(N - 1):
    graph[i].append((i + 1, 1))
    graph[i + 1].append((i, 1))
graph[X - 1].append((Y - 1, 1))
graph[Y - 1].append((X - 1, 1))
a = dijkstra(graph, 0)
count = defaultdict(int)
for i in range(N):
    a = dijkstra(graph, i)
    # print(a[i+1:])
    for c in a[i + 1 :]:
        count[c] += 1
# print(count)
for i in range(1, N):
    print((count[i]))

import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd


def input():
    return sys.stdin.readline().strip()


def INT():
    return int(eval(input()))


def MAP():
    return list(map(int, input().split()))


def S_MAP():
    return list(map(str, input().split()))


def LIST():
    return list(map(int, input().split()))


def S_LIST():
    return list(map(str, input().split()))


sys.setrecursionlimit(10**9)
INF = float("inf")
mod = 10**9 + 7
N, X, Y = MAP()
graph = [[] for i in range(N)]
for i in range(N - 1):
    graph[i].append(i + 1)
    graph[i + 1].append(i)
graph[X - 1].append(Y - 1)
graph[Y - 1].append(X - 1)
dic = defaultdict(int)
for i in range(N):
    q = deque()
    q.append(i)
    dist = [INF] * N
    dist[i] = 0
    while q:
        n = q.popleft()
        for node in graph[n]:
            if dist[node] == INF:
                dist[node] = dist[n] + 1
                q.append(node)
    for d in dist:
        dic[d] += 1
for k in range(1, N):
    print((dic[k] // 2))

-from heapq import heappop, heappush, heapify - - -def dijkstra(E, start): -    N_d = len(E) -    dist = [INF] * N_d -    dist[start] = 0 -    q = [(0, start)] +N, X, Y = MAP() +graph = [[] for i in range(N)] +for i in range(N - 1): +    graph[i].append(i + 1) +    graph[i + 1].append(i) +graph[X - 1].append(Y - 1) +graph[Y - 1].append(X - 1) +dic = defaultdict(int) +for i in range(N): +    q = deque() +    q.append(i) +    dist = [INF] * N +    dist[i] = 0 -        dist_v, v = heappop(q) -        if dist[v] != dist_v: -            continue -        for u, dist_vu in E[v]: -            dist_u = dist_v + dist_vu -            if dist_u < dist[u]: -                dist[u] = dist_u -                heappush(q, (dist_u, u)) -    return dist - - -N, X, Y = MAP() -graph = defaultdict(list) -for i in range(N - 1): -    graph[i].append((i + 1, 1)) -    graph[i + 1].append((i, 1)) -graph[X - 1].append((Y - 1, 1)) -graph[Y - 1].append((X - 1, 1)) -a = dijkstra(graph, 0) -count = defaultdict(int) -for i in range(N): -    a = dijkstra(graph, i) -    # print(a[i+1:]) -    for c in a[i + 1 :]: -        count[c] += 1 -# print(count) -for i in range(1, N): -    print((count[i])) +        n = q.popleft() +        for node in graph[n]: +            if dist[node] == INF: +                dist[node] = dist[n] + 1 +                q.append(node) +    for d in dist: +        dic[d] += 1 +for k in range(1, N): +    print((dic[k] // 2))