Buggy python submission (verdict: Time Limit Exceeded):
n,x,y = map(int,input().split())

mn_ln = [[0 for _ in range(n-1)] for _ in range(n)]

dic = {}
x = x-1
y = y-1
for i in range(n):
    for j in range(n):
        if(i == j):
            break

        nm = abs(j - i)
        if(abs(x-i) > abs(y-i)):
            lp = abs(y-i) + abs(x-j) + 1
        else:
            lp = abs(x-i) + abs(y-j) + 1
        
        k = min(nm,lp)
        if(k in dic):
            dic[k] += 1
        else:
            dic[k] = 1
#print(dic[2])


for i in range(1,n):
    if not (i in dic):
        print(0)
    else:
        print(dic[i])


Fixed submission:
n,x,y = map(int,input().split())


dic = {}
x = x-1
y = y-1
for i in range(n):
    for j in range(n):
        if(i == j):
            break

        nm = abs(j - i)
        if(abs(x-i) > abs(y-i)):
            lp = abs(y-i) + abs(x-j) + 1
        else:
            lp = abs(x-i) + abs(y-j) + 1
        
        k = min(nm,lp)
        if(k in dic):
            dic[k] += 1
        else:
            dic[k] = 1



for i in range(1,n):
    if not (i in dic):
        print(0)
    else:
        print(dic[i])

Buggy python submission (verdict: Time Limit Exceeded):
from collections import deque
n,x,y = map(int,input().split())


graph = {}

for i in range(n):
    if(i == 0):
        graph[i] = [1]
    elif(i == n-1):
        graph[i] = [n-2]
    else:
        graph[i] = [i-1,i+1]


#print(graph)

xx = graph[x-1]
xx.append(y-1)
graph[x-1] = xx

yy = graph[y-1]
yy.append(x-1)
graph[y-1] = yy

#print(graph)

def bfs(graph,st):
    q = deque()
    q.append(st)
    dist = [-1]*n
    dist[st] = 0
    
    while len(q) > 0:
    # キューの先頭（左端）からnodeを取り出す
        v = q.popleft()
        
        for i in graph[v]:
            if (dist[i] != -1):
                continue
            dist[i] = dist[v] + 1;
            q.append(i)
    
    return dist

res = [[0 for _ in range(n)] for _ in range(n)]
for i in range(n):
    res[i] = bfs(graph,i)

#print(res)

for k in range(1,n):
    ress = 0
    for i in range(n):
        ress += res[i].count(k)
    
    
    print(ress//2)

Fixed submission:
n,x,y = map(int,input().split())


dic = {}
x = x-1
y = y-1
for i in range(n):
    for j in range(n):
        if(i == j):
            break

        nm = abs(j - i)
        if(abs(x-i) > abs(y-i)):
            lp = abs(y-i) + abs(x-j) + 1
        else:
            lp = abs(x-i) + abs(y-j) + 1
        
        k = min(nm,lp)
        if(k in dic):
            dic[k] += 1
        else:
            dic[k] = 1



for i in range(1,n):
    if not (i in dic):
        print(0)
    else:
        print(dic[i])

Buggy python submission (verdict: Time Limit Exceeded):
from collections import deque
n,x,y = map(int,input().split())


graph = {}

for i in range(n):
    if(i == 0):
        graph[i] = [1]
    elif(i == n-1):
        graph[i] = [n-2]
    else:
        graph[i] = [i-1,i+1]


#print(graph)

xx = graph[x-1]
xx.append(y-1)
graph[x-1] = xx

yy = graph[y-1]
yy.append(x-1)
graph[y-1] = yy

#print(graph)

def bfs(graph,st):
    q = deque()
    q.append(st)
    dist = [-1]*n
    dist[st] = 0
    
    while len(q) > 0:
    # キューの先頭（左端）からnodeを取り出す
        v = q.popleft()
        
        for i in graph[v]:
            if (dist[i] != -1):
                continue
            dist[i] = dist[v] + 1;
            q.append(i)
    
    return dist

res = [[0 for _ in range(n)] for _ in range(n)]
for i in range(n):
    res[i] = bfs(graph,i)

#print(res)

for k in range(1,n):
    ress = 0
    for i in range(n):
        ress += res[i].count(k)
    
    
    print(ress//2)

Fixed submission:
n,x,y = map(int,input().split())


dic = {}
x = x-1
y = y-1
for i in range(n):
    for j in range(n):
        if(i == j):
            break

        nm = abs(j - i)
        if(abs(x-i) > abs(y-i)):
            lp = abs(y-i) + abs(x-j) + 1
        else:
            lp = abs(x-i) + abs(y-j) + 1
        
        k = min(nm,lp)
        if(k in dic):
            dic[k] += 1
        else:
            dic[k] = 1



for i in range(1,n):
    if not (i in dic):
        print(0)
    else:
        print(dic[i])