Buggy python submission (verdict: Time Limit Exceeded):
N,X,Y = map(int,input().split())
A = []
for i in range(N-1):
    a = i+1
    for j in range(i+1,N):
        b = j+1
        A.append(min([b-a,abs(X-a)+abs(Y-b)+1]))
for i in range(1,N):
    print(A.count(i))

Fixed submission:
N,X,Y = map(int,input().split())
A = [0 for i in range(N)]
for i in range(N-1):
    a = i+1
    for j in range(i+1,N):
        b = j+1
        A[min([b-a,abs(X-a)+abs(Y-b)+1])] += 1
for i in range(1,N):
    print(A[i])

Buggy python submission (verdict: Time Limit Exceeded):
N,X,Y = map(int,input().split())
S = [[0 for j in range(N)] for i in range(N)]
A = []
for i in range(N-1):
    a = i+1
    for j in range(i+1,N):
        b = j+1
        S[i][j] = min([b-a,abs(X-a)+abs(Y-b)+1])
for i in range(N-1):
    for j in range(i+1,N):
        A.append(S[i][j])
for i in range(1,N):
    print(A.count(i))

Fixed submission:
N,X,Y = map(int,input().split())
A = [0 for i in range(N)]
for i in range(N-1):
    a = i+1
    for j in range(i+1,N):
        b = j+1
        A[min([b-a,abs(X-a)+abs(Y-b)+1])] += 1
for i in range(1,N):
    print(A[i])

Buggy python submission (verdict: Time Limit Exceeded):
N,X,Y = map(int,input().split())
for k in range(1,N):
    S = 0
    for i in range(1,N):
        for j in range(i+1,N+1):
            if min(j-i,abs(X-i)+abs(Y-j)+1,abs(X-j)+abs(Y-i)+1) == k:
                S += 1
    print(S)

Fixed submission:
N,X,Y = map(int,input().split())
A = [0 for i in range(N)]
for i in range(N-1):
    a = i+1
    for j in range(i+1,N):
        b = j+1
        A[min([b-a,abs(X-a)+abs(Y-b)+1])] += 1
for i in range(1,N):
    print(A[i])

Buggy python submission (verdict: Time Limit Exceeded):
N,X,Y = map(int,input().split())
for k in range(1,N):
    S = 0
    for i in range(1,N):
        for j in range(i+1,N+1):
            if min(j-i,abs(X-i)+abs(Y-j)+1) == k:
                S += 1
    print(S)

Fixed submission:
N,X,Y = map(int,input().split())
A = [0 for i in range(N)]
for i in range(N-1):
    a = i+1
    for j in range(i+1,N):
        b = j+1
        A[min([b-a,abs(X-a)+abs(Y-b)+1])] += 1
for i in range(1,N):
    print(A[i])

Buggy python submission (verdict: Time Limit Exceeded):
N,X,Y = map(int,input().split())
for k in range(1,N):
    S = 0
    for i in range(1,N):
        for j in range(i+1,N+1):
            A = abs(X-i)+abs(Y-j)+1
            if j-i <= A:
                if j-i == k:
                    S += 1
            else:
                if A == k:
                    S += 1
    print(S)

Fixed submission:
N,X,Y = map(int,input().split())
A = [0 for i in range(N)]
for i in range(N-1):
    a = i+1
    for j in range(i+1,N):
        b = j+1
        A[min([b-a,abs(X-a)+abs(Y-b)+1])] += 1
for i in range(1,N):
    print(A[i])

Buggy python submission (verdict: Time Limit Exceeded):
N,X,Y = map(int,input().split())
for k in range(1,N):
    S = 0
    for i in range(1,N):
        for j in range(i+1,N+1):
            if j-i <= abs(X-i)+abs(Y-j)+1:
                if j-i == k:
                    S += 1
            else:
                if abs(X-i)+abs(Y-j)+1 == k:
                    S += 1
    print(S)

Fixed submission:
N,X,Y = map(int,input().split())
A = [0 for i in range(N)]
for i in range(N-1):
    a = i+1
    for j in range(i+1,N):
        b = j+1
        A[min([b-a,abs(X-a)+abs(Y-b)+1])] += 1
for i in range(1,N):
    print(A[i])

Buggy python submission (verdict: Time Limit Exceeded):
N,X,Y = map(int,input().split())
for k in range(1,N):
    S = 0
    for i in range(1,N):
        for j in range(i+1,N+1):
            if (i<= X and j<=X) or (i>=Y and j>=Y):
                if j-i == k:
                    S += 1
            elif i <= X and j >= Y:
                if j-i+X-Y+1 == k:
                    S += 1
            elif i > X and j < Y:
                if j-i <= Y-j+i-X+1:
                    if j-i == k:
                        S += 1
                else:
                    if Y-j+i-X+1 == k:
                        S += 1
            elif i <= X:
                if j-i <= X+Y-i-j+1:
                    if j-i == k:
                        S += 1
                else:
                    if X+Y-i-j+1 == k:
                        S += 1
            else:
                if j-i <= -X-Y+i+j+1:
                    if j-i == k:
                        S += 1
                else:
                    if -X-Y+i+j+1 == k:
                        S += 1
    print(S)

Fixed submission:
N,X,Y = map(int,input().split())
A = [0 for i in range(N)]
for i in range(N-1):
    a = i+1
    for j in range(i+1,N):
        b = j+1
        A[min([b-a,abs(X-a)+abs(Y-b)+1])] += 1
for i in range(1,N):
    print(A[i])

Buggy python submission (verdict: Time Limit Exceeded):
N,X,Y = map(int,input().split())
for k in range(1,N):
    S = 0
    for i in range(1,N):
        for j in range(i+1,N+1):
            if (i<= X and j<=X) or (i>=Y and j>=Y):
                if j-i == k:
                    S += 1
            elif i <= X and j >= Y:
                if j-i+X-Y+1 == k:
                    S += 1
            elif i >= X and j <= Y:
                if j-i <= Y-j+i-X+1:
                    if j-i == k:
                        S += 1
                else:
                    if Y-j+i-X+1 == k:
                        S += 1
            elif i <= X and X <= j <= Y:
                if j-i <= X+Y-i-j+1:
                    if j-i == k:
                        S += 1
                else:
                    if X+Y-i-j+1 == k:
                        S += 1
            elif j >= Y and X <= i <= Y:
                if j-i <= -X-Y+i+j+1:
                    if j-i == k:
                        S += 1
                else:
                    if -X-Y+i+j+1 == k:
                        S += 1
            else:
                print(i,j,k)
    print(S)

Fixed submission:
N,X,Y = map(int,input().split())
A = [0 for i in range(N)]
for i in range(N-1):
    a = i+1
    for j in range(i+1,N):
        b = j+1
        A[min([b-a,abs(X-a)+abs(Y-b)+1])] += 1
for i in range(1,N):
    print(A[i])