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>
#include <math.h>

void swap(double *x, double *y){
    double c;
    c=*x;
    *x=*y;
    *y=c;
}
void SortData(double data[] ,int N){
    int i,j;
    for(i=0;i<N-1;i++){
        for(j=0;j<N-1;j++){
            if(data[j]>data[j+1]){
                swap(&data[j],&data[j+1]);
            }
        }
    }
}

int main(){
    double a, b, c;
    scanf("%lf %lf %lf", &a, &b, &c);
    double A[3];
    A[0] = fabs(a - b);
    A[1] = fabs(a - c);
    A[2] = fabs(b - c);
    SortData(A, 3);
    printf("%.0f",(A[0]+A[1]));
    return 0;
}