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

#ans = [0] * n
ans = np.zeros(n,np.uint16)
for i in range(1,n):
    for j in range(i+1,n+1):
        ans[min(j-i,abs(x-i)+1+abs(y-j),abs(y-i)+1+abs(x-j))] += 1

for i in range(1,n):
    print(ans[i])

Fixed submission:
import numpy as np
n, x, y = map(int, input().split())

ans = [0] * n
for i in range(1,n):
    for j in range(i+1,n+1):
        ans[min(j-i,abs(x-i)+1+abs(y-j),abs(y-i)+1+abs(x-j))] += 1

for i in range(1,n):
    print(ans[i])

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

ans = np.zeros(n+1,dtype=np.uint32)
for i in range(1,n):
    for j in range(i+1,n+1):
        ans[min(j-i,abs(x-i)+1+abs(y-j),abs(y-i)+1+abs(x-j))] += 1

for i in range(1,n):
    print(ans[i])

Fixed submission:
import numpy as np
n, x, y = map(int, input().split())

ans = [0] * n
for i in range(1,n):
    for j in range(i+1,n+1):
        ans[min(j-i,abs(x-i)+1+abs(y-j),abs(y-i)+1+abs(x-j))] += 1

for i in range(1,n):
    print(ans[i])

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

ans = np.zeros(n+1,dtype=np.int64)
for i in range(1,n):
    for j in range(i+1,n+1):
        ans[min(j-i,abs(x-i)+1+abs(y-j))] += 1

for i in range(1,n):
    print(ans[i])

Fixed submission:
import numpy as np
n, x, y = map(int, input().split())

ans = [0] * n
for i in range(1,n):
    for j in range(i+1,n+1):
        ans[min(j-i,abs(x-i)+1+abs(y-j),abs(y-i)+1+abs(x-j))] += 1

for i in range(1,n):
    print(ans[i])

Buggy python submission (verdict: Time Limit Exceeded):
import numpy as np
n, x, y = map(int, input().split())
g1 = np.zeros((n+1,n+1),dtype=np.int64)
g2 = np.zeros((n+1,n+1),dtype=np.int64)
ans = np.zeros(n+1,dtype=np.int64)
for i in range(1,n+1):
    g1[i,i:] = range(n - i + 1)

#for i in range(1,n+1):
#    print(g1[i,1:])


for i in range(1,x+1):
    g2[i,i:y+1] = range(x - i + 1 , x - 2 * i + 2 + y )[::-1]
    g2[i,y+1:] = range(x - i + 2,x - i + 2 + n - y)

for i in range(x+1,n+1):
    #print(i,i - x + 1 , i - x + 1 + n - i )
    if i+1 < y+1:
        g2[i,i+1:y+1] = range(i - x + 1 , i - x + 1 + y - i  )[::-1]
    g2[i,y+1:] = range(i - x + 2,i - x + 2 + n - y)


#for i in range(1,n+1):
#    print(g2[i,1:])

#print('aaa')
g = np.minimum(g1,g2)

#for i in range(1,n+1):
#    print(g[i,1:])

for i in range(1,n + 1):
    for j in range(i+1,n+1):
        ans[g[i][j]] += 1

for i in range(1,n):
    print(ans[i])


Fixed submission:
import numpy as np
n, x, y = map(int, input().split())

ans = [0] * n
for i in range(1,n):
    for j in range(i+1,n+1):
        ans[min(j-i,abs(x-i)+1+abs(y-j),abs(y-i)+1+abs(x-j))] += 1

for i in range(1,n):
    print(ans[i])

Buggy python submission (verdict: Time Limit Exceeded):
import numpy as np
n, x, y = map(int, input().split())
g = np.zeros((n+1,n+1),dtype=np.int64)
ans = np.zeros((n+1),dtype=np.int64)
for i in range(1,n+1):
    for j in range(i+1,n+1):
        if j <= x:
            g[i][j] = g[i][j - 1] + 1
        elif j > x and j <= y:
            #print(i,j,g[i][x] + j - x , g[i][x] + y - j + 1)
            if i <= x:
                g[i][j] = min(g[i][x] + j - x , g[i][x] + y - j + 1)
            else:
                g[i][j] = min(g[i][j - 1] + 1 , i - x + 1 + y - j)
        else:
            g[i][j] = g[i][j - 1] + 1

        ans[g[i][j]] += 1
#for i in range(1,n+1):
#    print(g[i,1:])

for i in range(1,n):
    print(ans[i])

Fixed submission:
import numpy as np
n, x, y = map(int, input().split())

ans = [0] * n
for i in range(1,n):
    for j in range(i+1,n+1):
        ans[min(j-i,abs(x-i)+1+abs(y-j),abs(y-i)+1+abs(x-j))] += 1

for i in range(1,n):
    print(ans[i])