Buggy python submission (verdict: Time Limit Exceeded):
n,x,y = map(int,input().split())
ans = [0 for i in range(n)]
for i in range(n):
    for j in range(i,n):
        ans[min(j-i,(abs(i-(x-1))+1+abs(y-1-j)),(abs(i-(x-1))+1+abs(y-1-j)))] += 1
for i in range(1,n):
    print(ans[i])


Fixed submission:
n,x,y = map(int,input().split())
ans = [0]*n
for i in range(n):
    for j in range(i,n):
        ans[min(j-i,(abs(i-(x-1))+1+abs(y-1-j)),(abs(i-(x-1))+1+abs(y-1-j)))] += 1
for i in range(1,n):
    print(ans[i])

Buggy python submission (verdict: Time Limit Exceeded):
n,x,y = map(int,input().split())
ans = [0 for i in range(n)]
for i in range(n):
    for j in range(i,n):
        p = min(abs(i-j),(abs(i-(x-1))+1+abs(y-1-j)),(abs(i-(x-1))+1+abs(y-1-j)))
        if p != 0:
            ans[p] += 1
for i in range(1,n):
    print(ans[i])


Fixed submission:
n,x,y = map(int,input().split())
ans = [0]*n
for i in range(n):
    for j in range(i,n):
        ans[min(j-i,(abs(i-(x-1))+1+abs(y-1-j)),(abs(i-(x-1))+1+abs(y-1-j)))] += 1
for i in range(1,n):
    print(ans[i])

Buggy python submission (verdict: Time Limit Exceeded):
n,x,y = map(int,input().split())
ans = [0 for i in range(n)]
for i in range(n):
    for j in range(i,n):
        ans[min(abs(i-j),(abs(i-(x-1))+1+abs(y-1-j)),(abs(i-(x-1))+1+abs(y-1-j)))] += 1
for i in range(1,n):
    print(ans[i])


Fixed submission:
n,x,y = map(int,input().split())
ans = [0]*n
for i in range(n):
    for j in range(i,n):
        ans[min(j-i,(abs(i-(x-1))+1+abs(y-1-j)),(abs(i-(x-1))+1+abs(y-1-j)))] += 1
for i in range(1,n):
    print(ans[i])

Buggy python submission (verdict: Time Limit Exceeded):
n,x,y = map(int,input().split())
ans = [0 for i in range(n)]
for i in range(n):
    for j in range(i,n):
        p= min(abs(i-j),(abs(i-(x-1))+1+abs(y-1-j)),(abs(i-(x-1))+1+abs(y-1-j)))
        ans[p] += 1
for i in range(1,n):
    print(ans[i])


Fixed submission:
n,x,y = map(int,input().split())
ans = [0]*n
for i in range(n):
    for j in range(i,n):
        ans[min(j-i,(abs(i-(x-1))+1+abs(y-1-j)),(abs(i-(x-1))+1+abs(y-1-j)))] += 1
for i in range(1,n):
    print(ans[i])

Buggy python submission (verdict: Time Limit Exceeded):
n,x,y = map(int,input().split())
dic = [[0 for i in range(n)]for j in range(n)]
ans = [0 for i in range(n)]
for i in range(n):
    for j in range(i,n):
        dic[i][j] = min(abs(i-j),(abs(i-(x-1))+1+abs(y-1-j)),(abs(i-(x-1))+1+abs(y-1-j)))
        ans[dic[i][j]] += 1
for i in range(1,n):
    print(ans[i])


Fixed submission:
n,x,y = map(int,input().split())
ans = [0]*n
for i in range(n):
    for j in range(i,n):
        ans[min(j-i,(abs(i-(x-1))+1+abs(y-1-j)),(abs(i-(x-1))+1+abs(y-1-j)))] += 1
for i in range(1,n):
    print(ans[i])

Buggy python submission (verdict: Time Limit Exceeded):
n,x,y = map(int,input().split())
dic = [[0 for i in range(n)]for j in range(n)]
for i in range(n):
    for j in range(i,n):
        dic[i][j] = min(abs(i-j),(abs(i-(x-1))+1+abs(y-1-j)),(abs(i-(x-1))+1+abs(y-1-j)))
ans = [0 for i in range(n)]
for i in range(n):
    for j in range(i,n):
        ans[dic[i][j]] += 1
for i in range(1,n):
    print(ans[i])


Fixed submission:
n,x,y = map(int,input().split())
ans = [0]*n
for i in range(n):
    for j in range(i,n):
        ans[min(j-i,(abs(i-(x-1))+1+abs(y-1-j)),(abs(i-(x-1))+1+abs(y-1-j)))] += 1
for i in range(1,n):
    print(ans[i])

Buggy python submission (verdict: Time Limit Exceeded):
n,x,y = map(int,input().split())
dic = [[0 for i in range(n)]for j in range(n)]
for i in range(n):
    for j in range(i,n):
        dic[i][j] = abs(i-j)
        if i < x and y-1 <= j :
            dic[i][j] = dic[i][x-1]+1+(j-y+1)
        elif i < x and y-1 > j :
            dic[i][j] = min(abs(i-j),(abs(i-(x-1))+1+abs(y-1-j)))
        elif x <= i :
            dic[i][j] = min(abs(i-j),(abs(i-(x-1))+1+abs(y-1-j)))

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


Fixed submission:
n,x,y = map(int,input().split())
ans = [0]*n
for i in range(n):
    for j in range(i,n):
        ans[min(j-i,(abs(i-(x-1))+1+abs(y-1-j)),(abs(i-(x-1))+1+abs(y-1-j)))] += 1
for i in range(1,n):
    print(ans[i])