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

# Scenario 1: Directly use elevator A
cost1 = abs(A - S) + S  # A moves to S, then to 0

# Scenario 2: Use B to X, then A to 0
min_sum = float('inf')
for x in range(1, 101):
    current = abs(S - x) + abs(A - x) + x
    if current < min_sum:
        min_sum = current
cost2 = abs(B - S) + min_sum

print(min(cost1, cost2))