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

result = []
for i, j in combinations(range(1, N+1), 2):
    mins = min([j-i, abs(Y-j)+abs(X-i)+1])
    result.append(mins)
print(N)
for i in range(1, N-1):
    print(result.count(i+1))

Fixed submission:
from itertools import combinations
N, X, Y = map(int, input().split())

result = [0]*N
for i, j in combinations(range(1, N+1), 2):
    mins = min([j-i, abs(Y-j)+abs(X-i)+1])
    result[mins] += 1
    
for i in range(1, N):
    print(result[i])

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

result = []
for i, j in combinations(range(1, N+1), 2):
    jy = abs(Y-j)
    ix = abs(X-i)
    if (j-i)<=(jy+ix+1):
        result.append(j-i)
    else:
        result.append(jy+ix+1)
print(N)
for i in range(1, N-1):
    print(result.count(i+1))

Fixed submission:
from itertools import combinations
N, X, Y = map(int, input().split())

result = [0]*N
for i, j in combinations(range(1, N+1), 2):
    mins = min([j-i, abs(Y-j)+abs(X-i)+1])
    result[mins] += 1
    
for i in range(1, N):
    print(result[i])

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

result = []
for i, j in combinations(range(1, N+1), 2):
    if j<=X:
        result.append(j-i)
    else:
        jy = abs(Y-j)
        ix = abs(X-i)
        if (j-i)<=(jy+ix+1):
            result.append(j-i)
        else:
            result.append(jy+ix+1)
print(N)
for i in range(1, N-1):
    print(result.count(i+1))

Fixed submission:
from itertools import combinations
N, X, Y = map(int, input().split())

result = [0]*N
for i, j in combinations(range(1, N+1), 2):
    mins = min([j-i, abs(Y-j)+abs(X-i)+1])
    result[mins] += 1
    
for i in range(1, N):
    print(result[i])

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

result = []
for i in range(1, N+1):
    for j in range(i+1, N+1):
        if j<=X:
            result.append(j-i)
        else:
            jy = abs(Y-j)
            ix = abs(X-i)
            if (j-i)<=(jy+ix+1):
                result.append(j-i)
            else:
                result.append(jy+ix+1)
print(N)
for i in range(1, N-1):
    print(result.count(i+1))

Fixed submission:
from itertools import combinations
N, X, Y = map(int, input().split())

result = [0]*N
for i, j in combinations(range(1, N+1), 2):
    mins = min([j-i, abs(Y-j)+abs(X-i)+1])
    result[mins] += 1
    
for i in range(1, N):
    print(result[i])

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

result = []
for i in range(1, N+1):
    for j in range(i, N+1):
        if j<=X:
            result.append(j-i)
        else:
            jy = abs(Y-j)
            ix = abs(X-i)
            if (j-i)<=(jy+ix+1):
                result.append(j-i)
            else:
                result.append(jy+ix+1)
            
for i in range(N-1):
    print(result.count(i+1))

Fixed submission:
from itertools import combinations
N, X, Y = map(int, input().split())

result = [0]*N
for i, j in combinations(range(1, N+1), 2):
    mins = min([j-i, abs(Y-j)+abs(X-i)+1])
    result[mins] += 1
    
for i in range(1, N):
    print(result[i])

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

result = []
for i in range(1, N+1):
    for j in range(i, N+1):
        if j<=X:
            result.append(j-i)
        elif (i<=X)&(X<j<=Y):
            if (j-i)<=(Y-j+1+X-i):
                result.append(j-i)
            else:
                result.append(Y+X-j-i+1)
        elif (i<=X)&(Y<=j):
            result.append(j-Y+1+X-i)
        elif (X<i)&(j<=Y):
            if (j-i)<=(Y-j+1+i-X):
                result.append(j-i)
            else:
                result.append(Y-j+1+i-X)
        elif (X<i)&(Y<j):
            if (j-i)<=(j-Y+1+i-X):
                result.append(j-i)
            else:
                result.append(j-Y+1+i-X)
        else:
            #print(i, j)
            pass
            
for i in range(N-1):
    print(result.count(i+1))

Fixed submission:
from itertools import combinations
N, X, Y = map(int, input().split())

result = [0]*N
for i, j in combinations(range(1, N+1), 2):
    mins = min([j-i, abs(Y-j)+abs(X-i)+1])
    result[mins] += 1
    
for i in range(1, N):
    print(result[i])