Buggy python submission (verdict: Runtime Error):
N, X, Y = map(int, input().split(' '))

dct = {X : Y}
short = Y - X - 1

dist_list = [0] * N

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

for k in range(1,N):
    print(dist[k])

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

dist_list = [0] * N

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

for k in range(1,N):
    print(dist_list[k])

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

dct = {X : Y}
short = Y - X - 1

dist_list = []

for i in range(1,N):
    for j in range(i+1,N+1):
        d1 = abs(X - i) + 1 + abs(Y - j)
        d2 = j - i
        dist = min(d1,d2)
        dist_list.append(dist)

for k in range(1,N):
    print(dist_list.count(k))

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

dist_list = [0] * N

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

for k in range(1,N):
    print(dist_list[k])

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

dct = {X : Y}
short = Y - X - 1

dist_list = []

for i in range(1,N):
    for j in range(i+1,N+1):
        if i <= X and j >= Y:
            dist = j - i - short
        elif i <= X and j >= X and j <= Y:
            d1 = X - i + 1 + Y - j
            d2 = j - i
            dist = min(d1,d2)
        elif i >= X and i <= Y and j >= Y:
            d1 = i - X + 1 + j - Y
            d2 = j - i
            dist = min(d1,d2)
        elif i >= X and j <= Y:
            d1 = i - X + 1 + Y - j 
            d2 = j - i
            dist = min(d1,d2)
        else:
            dist = j - i
        dist_list.append(dist)

for k in range(1,N):
    print(dist_list.count(k))


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

dist_list = [0] * N

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

for k in range(1,N):
    print(dist_list[k])

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

dct = {X : Y}
short = Y - X - 1

dist_list = []

for i in range(1,N):
    for j in range(i+1,N+1):
        if i <= X and j >= Y:
            dist = j - i - short
        elif i <= X and j >= X and j <= Y:
            d1 = X - i + 1 + Y - j
            d2 = j - i
            dist = min(d1,d2)
        elif i >= X and i <= Y and j >= Y:
            d1 = i - X + 1 + j - Y
            d2 = j - i
            dist = min(d1,d2)
        elif i >= X and j <= Y:
            d1 = i - X + 1 + Y - j 
            d2 = j - i
            dist = min(d1,d2)
        else:
            dist = j - i
        dist_list.append(dist)

for k in range(1,N):
    print(dist_list.count(k))

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

dist_list = [0] * N

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

for k in range(1,N):
    print(dist_list[k])