A, B, S = map(int, input().split())

# Compute scenario 1: using elevator A directly
scenario1 = abs(A - S) + S

# Compute scenario 2: using elevator B to an intermediate floor then A
option1 = abs(B - S) + abs(A - S) + S

if A >= 1:
    option2 = abs(B - S) + abs(S - A) + A
    scenario2 = min(option1, option2)
else:
    scenario2 = option1

# Minimal total moves
minimal_total = min(scenario1, scenario2)

print(minimal_total)