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

def compute_b_path_sum(A, B, S):
    min_f = float('inf')
    for X in range(1, 101):
        current = abs(S - X) + abs(A - X) + X
        if current < min_f:
            min_f = current
    return abs(B - S) + min_f

if S == 1:
    sum_down = abs(A - 1) + 1
    dA = abs(A - 1)
    dB = abs(B - 1)
    if dA <= dB:
        sum_up = sum_down
    else:
        sum_up = compute_b_path_sum(A, B, 1)
    print(min(sum_down, sum_up))
else:
    dA = abs(A - S)
    dB = abs(B - S)
    if dA <= dB:
        print(dA + S)
    else:
        print(compute_b_path_sum(A, B, S))