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: Wrong Answer)

#include<stdio.h>

int main()
{
    int a[3];
    int low=101,total_cost=0,s1=0,s2=0;
    for (int i=0;i<3;i++)
    {
        scanf("%d",&a[i]);
        if (a[i]<low){
            low=a[i];
            s1=i;
        }
    }
    a[s1]=101;
    int low2=101;
    for (int i=0;i<3;i++)
    {
        if (a[i]<low2){
            low2=a[i];
            s2=i;
        }
    }
    total_cost=low2-low;
    printf("%d %d",low , low2);
    for (int i=0;i<3;i++)
    {
        if (i!=s1 && i!=s2)
            total_cost=total_cost+(a[i]-low2);
    }
    printf("%d",total_cost);

    return 0;
}