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

for i in range(1,n):
    print(ans[i])

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

for i in range(1,n):
    print(ans[i])

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

for i in range(1,n):
    print(ans[i]//2)

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

for i in range(1,n):
    print(ans[i])

Buggy python submission (verdict: Runtime Error):
n,x,y=map(int,input().split())
x-=1
y-=1
ans=[0 for i in range(n)]
for ni in range(n):
    d=[100000 for i in range(n)]
    q=[]
    q.append(ni)
    d[ni]=0
    while q:
        p=q.pop()
        if(p>0 and d[p-1]>d[p]+1):
            q.append(p-1)
            d[p-1]=d[p]+1
        if(p<n-1 and d[p+1]>d[p]+1):
            q.append(p+1)
            d[p+1]=d[p]+1

        if(p==x and d[y]>d[x]+1):
            q.append(y)
            d[y]=d[x]+1
        if(p==y and d[x]>d[y]+1):
            q.append(x)
            d[x]=d[y]+1
        break

    for i in range(n):ans[d[i]]+=1
for i in range(1,n):print(ans[i]//2)

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

for i in range(1,n):
    print(ans[i])

Buggy python submission (verdict: Time Limit Exceeded):
n,x,y=map(int,input().split())
x-=1
y-=1
ans=[0 for i in range(n)]
for ni in range(n):
    d=[100000 for i in range(n)]
    q=[]
    q.append(ni)
    d[ni]=0
    while q:
        p=q.pop()
        if(p>0 and d[p-1]>d[p]+1):
            q.append(p-1)
            d[p-1]=d[p]+1
        if(p<n-1 and d[p+1]>d[p]+1):
            q.append(p+1)
            d[p+1]=d[p]+1

        if(p==x and d[y]>d[x]+1):
            q.append(y)
            d[y]=d[x]+1
        if(p==y and d[x]>d[y]+1):
            q.append(x)
            d[x]=d[y]+1

    for i in range(n):ans[d[i]]+=1
for i in range(1,n):print(ans[i]//2)

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

for i in range(1,n):
    print(ans[i])

Buggy python submission (verdict: Time Limit Exceeded):
n,x,y=list(map(int,input().split()))

x-=1
y-=1
ans=[0 for i in range(n)]
for i in range(n):
    d=[100000 for i in range(n)]
    d[i]=0
    q=[]
    q.append(i)
    while q:
        p=q.pop()
        if(p-1>=0 and d[p]+1<d[p-1]):
            q.append(p-1)
            d[p-1]=d[p]+1
        if(p+1<n and d[p]+1<d[p+1]):
            q.append(p+1)
            d[p+1]=d[p]+1

        if(p==x and d[x]+1<d[y]):
            q.append(y)
            d[y]=d[x]+1
        if(p==y and d[y]+1<d[x]):
            q.append(x)
            d[x]=d[y]+1

    for j in range(n):ans[d[j]]+=1


for i in range(1,n):
    print(ans[i]//2)

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

for i in range(1,n):
    print(ans[i])

Buggy python submission (verdict: Time Limit Exceeded):
n,x,y=list(map(int,input().split()))

x-=1
y-=1
ans=[]
for i in range(n):
    d=[100000 for i in range(n)]
    d[i]=0
    q=[]
    q.append(i)
    while q:
        p=q.pop()
        if(p-1>=0 and d[p]+1<d[p-1]):
            q.append(p-1)
            d[p-1]=d[p]+1
        if(p+1<n and d[p]+1<d[p+1]):
            q.append(p+1)
            d[p+1]=d[p]+1

        if(p==x and d[x]+1<d[y]):
            q.append(y)
            d[y]=d[x]+1
        if(p==y and d[y]+1<d[x]):
            q.append(x)
            d[x]=d[y]+1

    ans.append(d)

ans2=[0 for i in range(n-1)]
for i in ans:
    for j in range(n-1):
        ans2[j]+=i.count(j+1)
for i in ans2:
    print(i//2)

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

for i in range(1,n):
    print(ans[i])

Buggy python submission (verdict: Time Limit Exceeded):
n,x,y=list(map(int,input().split()))

x-=1
y-=1
ans=[0 for i in range(n)]
for i in range(n):
    d=[100000 for i in range(n)]
    d[i]=0
    q=[]
    q.append(i)
    while q:
        p=q.pop()
        if(p-1>=0 and d[p]+1<d[p-1]):
            q.append(p-1)
            d[p-1]=d[p]+1
        if(p+1<n and d[p]+1<d[p+1]):
            q.append(p+1)
            d[p+1]=d[p]+1

        if(p==x and d[x]+1<d[y]):
            q.append(y)
            d[y]=d[x]+1
        if(p==y and d[y]+1<d[x]):
            q.append(x)
            d[x]=d[y]+1

    for j in range(1,n):
        ans[j]+=d.count(j)

for i in range(1,n):
    print(ans[i]//2)

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

for i in range(1,n):
    print(ans[i])