Buggy python submission (verdict: Time Limit Exceeded):
import numpy as np
n,x,y=map(int,input().split())
def dist(i,j):
  if i>=j:
    d=0
  else:
    d=min(abs(j-i),abs(y-j)+1+abs(x-i),abs(y-i)+1+abs(x-j))
  return d
for l in range(2,n+1):
  distmap=np.array([dist(k,l) for k in range(1,n+1) for l in range(2,n+1)])
[print(np.count_nonzero(distmap==m)) for m in range(1,n)]

Fixed submission:
n,x,y=map(int,input().split())
def dist(i,j):
  if i>=j:
    d=0
  else:
    d=min(abs(j-i),abs(y-j)+1+abs(x-i),abs(y-i)+1+abs(x-j))
  return d
distmap=[0]*n
for l in range(2,n+1):
  for k in range(1,l):
    distmap[dist(k,l)]+=1
print('\n'.join(map(str,distmap[1:])))

Buggy python submission (verdict: Time Limit Exceeded):
n,x,y=map(int,input().split())
def dist(i,j):
  return min(abs(j-i),abs(y-j)+1+abs(x-i),abs(y-i)+1+abs(x-j))
distmap=[]
for l in range(2,n+1):
  distmap[len(distmap):len(distmap)]=[dist(k,l) for k in range(1,l)]
[print(distmap.count(m)) for m in range(1,n)]

Fixed submission:
n,x,y=map(int,input().split())
def dist(i,j):
  if i>=j:
    d=0
  else:
    d=min(abs(j-i),abs(y-j)+1+abs(x-i),abs(y-i)+1+abs(x-j))
  return d
distmap=[0]*n
for l in range(2,n+1):
  for k in range(1,l):
    distmap[dist(k,l)]+=1
print('\n'.join(map(str,distmap[1:])))

Buggy python submission (verdict: Time Limit Exceeded):
n,x,y=map(int,input().split())
def dist(i,j):
  if i>=j:
    d=0
  elif i<x and y-(y-x)//2+1<=j<=y:
    d=y-j+1+x-i
  elif x<=i<=x+(y-x)//2-1 and y<j:
    d=j-y+1+i-x
  elif x<=i and j<=y:
    d=min(j-i,i+y-x+1-j)
  elif i<x and y<j:
    d=j-y+1+x-i
  else:
    d=j-i
  return d
distmap=[]
for l in range(2,n+1):
  distmap[len(distmap):len(distmap)]=[dist(k,l) for k in range(1,l)]
[print(distmap.count(m)) for m in range(1,n)]

Fixed submission:
n,x,y=map(int,input().split())
def dist(i,j):
  if i>=j:
    d=0
  else:
    d=min(abs(j-i),abs(y-j)+1+abs(x-i),abs(y-i)+1+abs(x-j))
  return d
distmap=[0]*n
for l in range(2,n+1):
  for k in range(1,l):
    distmap[dist(k,l)]+=1
print('\n'.join(map(str,distmap[1:])))

Buggy python submission (verdict: Time Limit Exceeded):
n,x,y=map(int,input().split())
def dist(i,j):
  if i>=j:
    d=0
  elif i<x and y-(y-x)//2+1<=j<=y:
    d=y-j+1+x-i
  elif x<=i<=x+(y-x)//2-1 and y<j:
    d=j-y+1+i-x
  elif x<=i and j<=y:
    d=min(j-i,i+y-x+1-j)
  elif i<x and y<j:
    d=j-y+1+x-i
  else:
    d=j-i
  return d
distmap=[]
for l in range(2,n+1):
  distmap[len(distmap):len(distmap)]=[dist(k,l) for k in range(1,l)]
[print(distmap.count(m)) for m in range(1,n)]

Fixed submission:
n,x,y=map(int,input().split())
def dist(i,j):
  if i>=j:
    d=0
  else:
    d=min(abs(j-i),abs(y-j)+1+abs(x-i),abs(y-i)+1+abs(x-j))
  return d
distmap=[0]*n
for l in range(2,n+1):
  for k in range(1,l):
    distmap[dist(k,l)]+=1
print('\n'.join(map(str,distmap[1:])))

Buggy python submission (verdict: Time Limit Exceeded):
n,x,y=map(int,input().split())
def dist(i,j):
  if i>=j:
    d=0
  elif i<x and y-(y-x)//2+1<=j<=y:
    d=y-j+1+x-i
  elif x<=i<=x+(y-x)//2-1 and y<j:
    d=j-y+1+i-x
  elif x<=i and j<=y:
    d=min(j-i,i+y-x+1-j)
  elif i<x and y<j:
    d=j-y+1+x-i
  else:
    d=j-i
  return d
distmap=[dist(k+1,l+1) for k in range(n-1) for l in range(n)]
[print(distmap.count(i+1)) for i in range(n-1)]

Fixed submission:
n,x,y=map(int,input().split())
def dist(i,j):
  if i>=j:
    d=0
  else:
    d=min(abs(j-i),abs(y-j)+1+abs(x-i),abs(y-i)+1+abs(x-j))
  return d
distmap=[0]*n
for l in range(2,n+1):
  for k in range(1,l):
    distmap[dist(k,l)]+=1
print('\n'.join(map(str,distmap[1:])))