Buggy python submission (verdict: Time Limit Exceeded):
N,X,Y=map(int,input().split())

d=[[0 for _ in range(N)] for _ in range(N)]
ans=[0]*N
for i in range(N):
    for j in range(i+1,N):
        d[i][j]=min(abs(i-j),abs(X-1-i)+abs(Y-1-j)+1,abs(X-1-j)+abs(Y-1-i)+1)
        ans[d[i][j]-1]+=1

for o in range(N-1):
    print(ans[o])

Fixed submission:
N,X,Y=map(int,input().split())

d=[[0 for _ in range(N)] for _ in range(N)]

for i in range(N):
    for j in range(i+1,N):
        d[i][j]=min(abs(i-j),abs(X-1-i)+abs(Y-1-j)+1,abs(X-1-j)+abs(Y-1-i)+1)

ans=[0 for _ in range(N)]
for k in range(N):
    for l in range(k+1,N):
        if d[k][l]<N:
            ans[d[k][l]]+=1
    
for o in range(N-1):
    print(ans[o+1])

Buggy python submission (verdict: Time Limit Exceeded):
N,X,Y=map(int,input().split())

d=[[0 for _ in range(N)] for _ in range(N)]

for i in range(N):
    for j in range(i+1,N):
        d[i][j]=min(abs(i-j),abs(X-1-i)+abs(Y-1-j)+1,abs(X-1-j)+abs(Y-1-i)+1)

ans=[0 for _ in range(N)]
for k in range(N):
    for l in range(k+1,N):
        if d[k][l]<N:
            ans[d[k][l]]+=1
    
for o in range(N-1):
    print(ans[o+1])

Fixed submission:
N,X,Y=map(int,input().split())

d=[[0 for _ in range(N)] for _ in range(N)]

for i in range(N):
    for j in range(i+1,N):
        d[i][j]=min(abs(i-j),abs(X-1-i)+abs(Y-1-j)+1,abs(X-1-j)+abs(Y-1-i)+1)

ans=[0 for _ in range(N)]
for k in range(N):
    for l in range(k+1,N):
        if d[k][l]<N:
            ans[d[k][l]]+=1
    
for o in range(N-1):
    print(ans[o+1])

Buggy python submission (verdict: Time Limit Exceeded):
from scipy.sparse.csgraph import floyd_warshall
N,X,Y=map(int,input().split())
d=[[10**7 for _ in range(N)] for _ in range(N)]
for a in range(1,N):
    d[a-1][a]=1
    d[a][a-1]=1
d[X-1][Y-1]=1
d[Y-1][X-1]=1

d = floyd_warshall(d)

ans=[0 for _ in range(N)]
for k in range(N):
    for l in range(k+1,N):
        if d[k][l]<N:
            ans[int(d[k][l])]+=1
    
for o in range(N-1):
    print(ans[o+1])


Fixed submission:
N,X,Y=map(int,input().split())

d=[[0 for _ in range(N)] for _ in range(N)]

for i in range(N):
    for j in range(i+1,N):
        d[i][j]=min(abs(i-j),abs(X-1-i)+abs(Y-1-j)+1,abs(X-1-j)+abs(Y-1-i)+1)

ans=[0 for _ in range(N)]
for k in range(N):
    for l in range(k+1,N):
        if d[k][l]<N:
            ans[d[k][l]]+=1
    
for o in range(N-1):
    print(ans[o+1])

Buggy python submission (verdict: Time Limit Exceeded):
N,X,Y=map(int,input().split())

d=[[10**7 for _ in range(N)] for _ in range(N)]
for a in range(1,N):
    d[a-1][a]=1
    d[a][a-1]=1
d[X-1][Y-1]=1
d[Y-1][X-1]=1

for i in range(N):
    for j in range(N):
        for k in range(N):
            d[i][j]=min(d[i][k]+d[k][j],d[i][j])
for i in range(N):
    for j in range(N):
        for k in range(N):
            d[i][j]=min(d[i][k]+d[k][j],d[i][j])

ans=[0 for _ in range(N)]
for k in range(N):
    for l in range(k+1,N):
        if d[k][l]<N:
            ans[d[k][l]]+=1
    
for o in range(N-1):
    print(ans[o+1])

Fixed submission:
N,X,Y=map(int,input().split())

d=[[0 for _ in range(N)] for _ in range(N)]

for i in range(N):
    for j in range(i+1,N):
        d[i][j]=min(abs(i-j),abs(X-1-i)+abs(Y-1-j)+1,abs(X-1-j)+abs(Y-1-i)+1)

ans=[0 for _ in range(N)]
for k in range(N):
    for l in range(k+1,N):
        if d[k][l]<N:
            ans[d[k][l]]+=1
    
for o in range(N-1):
    print(ans[o+1])

Buggy python submission (verdict: Time Limit Exceeded):
N,X,Y=map(int,input().split())

d=[[10**7 for _ in range(N)] for _ in range(N)]
for a in range(1,N):
    d[a-1][a]=1
    d[a][a-1]=1
d[X-1][Y-1]=1
d[Y-1][X-1]=1

for i in range(N):
    for j in range(N):
        for k in range(N):
            d[i][j]=min(d[i][k]+d[k][j],d[i][j])
for i in range(N):
    for j in range(N):
        for k in range(N):
            d[i][j]=min(d[i][k]+d[k][j],d[i][j])

ans=[0 for _ in range(N)]
for k in range(N):
    for l in range(k+1,N):
        if d[k][l]<N:
            ans[d[k][l]]+=1
    
for o in range(N-1):
    print(ans[o+1])

Fixed submission:
N,X,Y=map(int,input().split())

d=[[0 for _ in range(N)] for _ in range(N)]

for i in range(N):
    for j in range(i+1,N):
        d[i][j]=min(abs(i-j),abs(X-1-i)+abs(Y-1-j)+1,abs(X-1-j)+abs(Y-1-i)+1)

ans=[0 for _ in range(N)]
for k in range(N):
    for l in range(k+1,N):
        if d[k][l]<N:
            ans[d[k][l]]+=1
    
for o in range(N-1):
    print(ans[o+1])