Problem:
Score : 100 points

Problem Statement

You have three tasks, all of which need to be completed.

First, you can complete any one task at cost 0.

Then, just after completing the i-th task, you can complete the j-th task at cost |A_j - A_i|.

Here, |x| denotes the absolute value of x.

Find the minimum total cost required to complete all the task.

Constraints

All values in input are integers.

1 \leq A_1, A_2, A_3 \leq 100

Input

Input is given from Standard Input in the following format:

A_1 A_2 A_3

Output

Print the minimum total cost required to complete all the task.

Sample Input 1

1 6 3

Sample Output 1

5

When the tasks are completed in the following order, the total cost will be 5, which is the minimum:

Complete the first task at cost 0.

Complete the third task at cost 2.

Complete the second task at cost 3.

Sample Input 2

11 5 5

Sample Output 2

6

Sample Input 3

100 100 100

Sample Output 3

0

Solution in Python (3.4.3) (judge verdict: Accepted)

#103a
import itertools
a1,a2,a3 = map(int, input().split())

#任意の 1 個のタスクをコスト 0で完了できます。
#また、i番目のタスクを完了した直後にコスト |Aj−Ai| で j番目のタスクを完了できます。
#全てのタスクを完了するのに要する合計コストの最小値を求めてください。
seq = [a1,a2,a3]
ans = a1+a2+a3

for perm in list(itertools.permutations(seq)):
    cost = 0 + abs(perm[1]-perm[0]) + abs(perm[2]-perm[1])
    if cost < ans:
        ans = cost
        
print(ans)