Buggy python submission (verdict: Time Limit Exceeded):
def s0():return input()
def s1():return input().split()
def s2(n):return [input() for x in range(n)]
def n0():return int(input())
def n1():return [int(x) for x in input().split()]
def n2(n):return [int(input()) for _ in range(n)]
def n3(n):return [[int(x) for x in input().split()] for _ in range(n)]

n,x,y=n1()

a=[]
for i in range(1,n+1):
    for j in range(i+1,n+1):
        if i<=x and j<=x:
            a.append([(i,j),j-i])
        elif i<=x and x<j<y:
            a.append([(i,j),min(j-i,y-j+1+x-i)])
        elif i<=x:
            a.append([(i,j),j-y+1+x-i])
        elif i<=y and j<=y:
            a.append([(i,j),min(j-i,y-j+1+i-x)])
        elif i<=y:
            a.append([(i,j),min(j-i,j-y+1+i-x)])
        else:
            a.append([(i,j),j-i])
for k in range(1,n):
    ans=0
    for h in range(len(a)):
        if a[h][1]==k:
            ans+=1
    print(ans)

Fixed submission:
def s0():return input()
def s1():return input().split()
def s2(n):return [input() for x in range(n)]
def n0():return int(input())
def n1():return [int(x) for x in input().split()]
def n2(n):return [int(input()) for _ in range(n)]
def n3(n):return [[int(x) for x in input().split()] for _ in range(n)]

n,x,y=n1()

a=[0]*n
for i in range(1,n+1):
    for j in range(i+1,n+1):
        if i<=x and j<=x:
            a[j-i]+=1
        elif i<=x and x<j<y:
            a[min(j-i,y-j+1+x-i)]+=1
        elif i<=x:
            a[j-y+1+x-i]+=1
        elif i<=y and j<=y:
            a[min(j-i,y-j+1+i-x)]+=1
        elif i<=y:
            a[min(j-i,j-y+1+i-x)]+=1
        else:
            a[j-i]+=1
for k in range(1,n):
    print(a[k])

Buggy python submission (verdict: Time Limit Exceeded):
def s0():return input()
def s1():return input().split()
def s2(n):return [input() for x in range(n)]
def n0():return int(input())
def n1():return [int(x) for x in input().split()]
def n2(n):return [int(input()) for _ in range(n)]
def n3(n):return [[int(x) for x in input().split()] for _ in range(n)]

n,x,y=n1()

a=[]
for i in range(1,n+1):
    for j in range(i+1,n+1):
        if i<=x and j<=x:
            a.append([(i,j),j-i])
        elif i<=x and x<j<y:
            a.append([(i,j),min(j-i,y-j+1+x-i)])
        elif i<=x:
            a.append([(i,j),j-y+1+x-i])
        elif i<=y and j<=y:
            a.append([(i,j),min(j-i,y-j+1+i-x)])
        elif i<=y:
            a.append([(i,j),min(j-i,j-y+1+i-x)])
        else:
            a.append([(i,j),j-i])
for k in range(1,n):
    ans=0
    for h in range(len(a)):
        if a[h][1]==k:
            ans+=1
    print(ans)

Fixed submission:
def s0():return input()
def s1():return input().split()
def s2(n):return [input() for x in range(n)]
def n0():return int(input())
def n1():return [int(x) for x in input().split()]
def n2(n):return [int(input()) for _ in range(n)]
def n3(n):return [[int(x) for x in input().split()] for _ in range(n)]

n,x,y=n1()

a=[0]*n
for i in range(1,n+1):
    for j in range(i+1,n+1):
        if i<=x and j<=x:
            a[j-i]+=1
        elif i<=x and x<j<y:
            a[min(j-i,y-j+1+x-i)]+=1
        elif i<=x:
            a[j-y+1+x-i]+=1
        elif i<=y and j<=y:
            a[min(j-i,y-j+1+i-x)]+=1
        elif i<=y:
            a[min(j-i,j-y+1+i-x)]+=1
        else:
            a[j-i]+=1
for k in range(1,n):
    print(a[k])