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 C (GCC 5.4.1) (judge verdict: Accepted)

#include<stdio.h>
int main(void){
int A[3], ch, a, b, c;
for(int i=0;i<3;i++){
scanf("%d",&A[i]);//昇順に並べる
}
for(int i=0;i<3;i++){
    for(int j=i+1;j<3;j++){
        if(A[i]>A[j]){
    ch=A[j];
    A[j]=A[i];
    A[i]=ch;
        }
    }
}
a=A[1]-A[0];
b=A[2]-A[1];
c=A[2]-A[0];

if(a+b>=a+c && b+c>=a+c)printf("%d\n",a+c);
else if(a+c>=a+b && b+c>=a+b)printf("%d\n",a+b);
else printf("%d\n",b+c);
return 0;
}