Buggy python submission (verdict: Time Limit Exceeded):
N = [int(i) for i in input().split()]

answerList = []

for i in range(N[0]):
    answerList.append(0)

for i in range(N[0]):
    if i > 0:
        for j in range(N[0]):
            if j + 1 > i > 0:
                a = abs(j + 1 - i)
                if a == 1:
                    answerList[1] = answerList[1] + 1
                    continue
                calculateList = [a,
                                 abs(N[1] - i) + 1 + abs(j + 1 - N[2]),
                                 abs(N[2] - i) + 1 + abs(j + 1 - N[1])]
                answer = min(calculateList)
                answerList[answer] = answerList[answer] + 1

for i in range(N[0] - 1):
    print(answerList[i + 1])

Fixed submission:
N = [int(i) for i in input().split()]

answerList = []

for i in range(N[0]):
    answerList.append(0)

for i in range(N[0]):
    if i > 0:
        for j in range(N[0]):
            if j + 1 > i > 0:
                calculateList = [abs(j + 1 - i),
                                 abs(N[1] - i) + 1 + abs(j + 1 - N[2]),
                                 abs(N[2] - i) + 1 + abs(j + 1 - N[1])]
                answer = min(calculateList)
                answerList[answer] = answerList[answer] + 1

for i in range(N[0] - 1):
    print(answerList[i + 1])

Buggy python submission (verdict: Time Limit Exceeded):
N = [int(i) for i in input().split()]

answerList = []

for i in range(N[0]):
    answerList.append(0)

for i in range(N[0]):
    if i > 0:
        for j in range(N[0]):
            if j + 1 > i > 0:
                calculateList = [abs(j + 1 - i),
                                 abs(N[1] - i) + 1 + abs(j + 1 - N[2]),
                                 abs(N[2] - i) + 1 + abs(j + 1 - N[1])]
                answer = min(calculateList)
                answerList[answer] = answerList[answer] + 1

for i in range(N[0] - 1):
    print(answerList[i + 1])


Fixed submission:
N = [int(i) for i in input().split()]

answerList = []

for i in range(N[0]):
    answerList.append(0)

for i in range(N[0]):
    if i > 0:
        for j in range(N[0]):
            if j + 1 > i > 0:
                calculateList = [abs(j + 1 - i),
                                 abs(N[1] - i) + 1 + abs(j + 1 - N[2]),
                                 abs(N[2] - i) + 1 + abs(j + 1 - N[1])]
                answer = min(calculateList)
                answerList[answer] = answerList[answer] + 1

for i in range(N[0] - 1):
    print(answerList[i + 1])

Buggy python submission (verdict: Time Limit Exceeded):
N = [int(i) for i in input().split()]

answerList = [0] * 9999

for i in range(N[0]):
    if i > 0:
        for j in range(N[0]):
            if j + 1 > i > 0:
                calculateList = [abs(j + 1 - i),
                                 abs(N[1] - i) + 1 + abs(j + 1 - N[2]),
                                 abs(N[2] - i) + 1 + abs(j + 1 - N[1])]
                answerList[min(calculateList)] = answerList[
                                                     min(calculateList)] + 1

for i in range(N[0] - 1):
    print(answerList[i + 1])

Fixed submission:
N = [int(i) for i in input().split()]

answerList = []

for i in range(N[0]):
    answerList.append(0)

for i in range(N[0]):
    if i > 0:
        for j in range(N[0]):
            if j + 1 > i > 0:
                calculateList = [abs(j + 1 - i),
                                 abs(N[1] - i) + 1 + abs(j + 1 - N[2]),
                                 abs(N[2] - i) + 1 + abs(j + 1 - N[1])]
                answer = min(calculateList)
                answerList[answer] = answerList[answer] + 1

for i in range(N[0] - 1):
    print(answerList[i + 1])

Buggy python submission (verdict: Time Limit Exceeded):
N = [int(i) for i in input().split()]

answerList = []

for i in range(N[0]):
    answerList.append(0)

for i in range(N[0]):
    for j in range(N[0]):
        if j + 1 > i > 0:
            calculateList = [abs(j + 1 - i),
                             abs(N[1] - i) + 1 + abs(j + 1 - N[2]),
                             abs(N[2] - i) + 1 + abs(j + 1 - N[1])]
            answerList[min(calculateList)] = answerList[min(calculateList)] + 1

for i in range(N[0] - 1):
    print(answerList[i+1])


Fixed submission:
N = [int(i) for i in input().split()]

answerList = []

for i in range(N[0]):
    answerList.append(0)

for i in range(N[0]):
    if i > 0:
        for j in range(N[0]):
            if j + 1 > i > 0:
                calculateList = [abs(j + 1 - i),
                                 abs(N[1] - i) + 1 + abs(j + 1 - N[2]),
                                 abs(N[2] - i) + 1 + abs(j + 1 - N[1])]
                answer = min(calculateList)
                answerList[answer] = answerList[answer] + 1

for i in range(N[0] - 1):
    print(answerList[i + 1])

Buggy python submission (verdict: Time Limit Exceeded):
N = [int(i) for i in input().split()]

answerList = []

for i in range(N[0]+1):
    answerList.append(0)

for i in range(N[0]):
    for j in range(N[0]):
        if j + 1 > i > 0:
            calculateList = [abs(j + 1 - i),
                             abs(N[1] - i) + 1 + abs(j + 1 - N[2]),
                             abs(N[2] - i) + 1 + abs(j + 1 - N[1])]
            answerList[min(calculateList)] = answerList[min(calculateList)] + 1

for i in range(N[0] - 1):
    print(answerList[i+1])

Fixed submission:
N = [int(i) for i in input().split()]

answerList = []

for i in range(N[0]):
    answerList.append(0)

for i in range(N[0]):
    if i > 0:
        for j in range(N[0]):
            if j + 1 > i > 0:
                calculateList = [abs(j + 1 - i),
                                 abs(N[1] - i) + 1 + abs(j + 1 - N[2]),
                                 abs(N[2] - i) + 1 + abs(j + 1 - N[1])]
                answer = min(calculateList)
                answerList[answer] = answerList[answer] + 1

for i in range(N[0] - 1):
    print(answerList[i + 1])

Buggy python submission (verdict: Time Limit Exceeded):
N = [int(i) for i in input().split()]

answerList = []

for i in range(N[0]+1):
    answerList.append(0)

for i in range(N[0]):
    for j in range(N[0] + 1):
        if j > i > 0:
            calculateList = [abs(j - i),
                             abs(N[1] - i) + 1 + abs(j - N[2]),
                             abs(N[2] - i) + 1 + abs(j - N[1])]
            answerList[min(calculateList)] = answerList[min(calculateList)] + 1

for i in range(N[0] - 1):
    print(answerList[i+1])

Fixed submission:
N = [int(i) for i in input().split()]

answerList = []

for i in range(N[0]):
    answerList.append(0)

for i in range(N[0]):
    if i > 0:
        for j in range(N[0]):
            if j + 1 > i > 0:
                calculateList = [abs(j + 1 - i),
                                 abs(N[1] - i) + 1 + abs(j + 1 - N[2]),
                                 abs(N[2] - i) + 1 + abs(j + 1 - N[1])]
                answer = min(calculateList)
                answerList[answer] = answerList[answer] + 1

for i in range(N[0] - 1):
    print(answerList[i + 1])

Buggy python submission (verdict: Time Limit Exceeded):
N = [int(i) for i in input().split()]

answerList = []

for i in range(N[0]):
    for j in range(N[0] + 1):
        if j > i > 0:
            calculateList = [abs(j - i),
                             abs(N[1] - i) + 1 + abs(j - N[2]),
                             abs(N[2] - i) + 1 + abs(j - N[1])]
            answerList.append(min(calculateList))

for i in range(N[0] - 1):
    print(answerList.count(i + 1))

Fixed submission:
N = [int(i) for i in input().split()]

answerList = []

for i in range(N[0]):
    answerList.append(0)

for i in range(N[0]):
    if i > 0:
        for j in range(N[0]):
            if j + 1 > i > 0:
                calculateList = [abs(j + 1 - i),
                                 abs(N[1] - i) + 1 + abs(j + 1 - N[2]),
                                 abs(N[2] - i) + 1 + abs(j + 1 - N[1])]
                answer = min(calculateList)
                answerList[answer] = answerList[answer] + 1

for i in range(N[0] - 1):
    print(answerList[i + 1])

Buggy python submission (verdict: Time Limit Exceeded):
N = [int(i) for i in input().split()]

answerList = []

for i in range(N[0]):
    for j in range(N[0] + 1):
        if j > i > 0:
            calculateList = [abs(j - i),
                             abs(abs(N[1] - i) + + 1 + abs(j - N[2])),
                             abs(abs(N[2] - i) + + 1 + abs(j - N[1]))]
            answerList.append(min(calculateList))

for i in range(N[0] - 1):
    print(answerList.count(i + 1))

Fixed submission:
N = [int(i) for i in input().split()]

answerList = []

for i in range(N[0]):
    answerList.append(0)

for i in range(N[0]):
    if i > 0:
        for j in range(N[0]):
            if j + 1 > i > 0:
                calculateList = [abs(j + 1 - i),
                                 abs(N[1] - i) + 1 + abs(j + 1 - N[2]),
                                 abs(N[2] - i) + 1 + abs(j + 1 - N[1])]
                answer = min(calculateList)
                answerList[answer] = answerList[answer] + 1

for i in range(N[0] - 1):
    print(answerList[i + 1])

Buggy python submission (verdict: Time Limit Exceeded):
N = [int(i) for i in input().split()]

answerList = []

for i in range(N[0]):
    count = 0
    for j in range(N[0] + 1):
        if j > i > 0:
            calculateList = [abs(j - i),
                             abs(abs(N[1] - i) + + 1 + abs(j - N[2])),
                             abs(abs(N[2] - i) + + 1 + abs(j - N[1]))]

            answerList.append(min(calculateList))

for i in range(N[0] - 1):
    print(answerList.count(i + 1))


Fixed submission:
N = [int(i) for i in input().split()]

answerList = []

for i in range(N[0]):
    answerList.append(0)

for i in range(N[0]):
    if i > 0:
        for j in range(N[0]):
            if j + 1 > i > 0:
                calculateList = [abs(j + 1 - i),
                                 abs(N[1] - i) + 1 + abs(j + 1 - N[2]),
                                 abs(N[2] - i) + 1 + abs(j + 1 - N[1])]
                answer = min(calculateList)
                answerList[answer] = answerList[answer] + 1

for i in range(N[0] - 1):
    print(answerList[i + 1])