Score : 100 points
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.
Input is given from Standard Input in the following format:
A_1 A_2 A_3
Print the minimum total cost required to complete all the task.
1 6 3
5
When the tasks are completed in the following order, the total cost will be 5, which is the minimum:
11 5 5
6
100 100 100
0