program main
  implicit none
  integer :: N, X, Y
  integer :: i, j, distance
  integer, allocatable :: npath(:)

  read(*,*) N, X, Y
  allocate(npath(N-1))
  npath(:) = 0

  do j = 1, N-1
    do i = j+1, N
      if(i<=X)then
        distance = i - j
      elseif(j>=Y)then
        distance = i - j
      elseif(j <=X .and. Y<=i)then
        distance = i - j -(Y-X-1)
      elseif(X <=j .and. i<=Y)then
        distance = min(i-j, (j-X)+(Y-i)+1)
      elseif(j<= X .and. X < i .and. i <= Y)then
        distance = (X-j) + min(i-X, Y-i+1)
      else
        distance = (i-Y) + min(Y-j, j-X+1)
      endif
      npath(distance) = npath(distance) + 1
    enddo
  enddo

  do i = 1, N-1
    write(*,*) npath(i)
  enddo

end program main