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>

int main(void)
{
	int a1, a2, a3, min, a[6], i;

	scanf("%d %d %d", &a1, &a2, &a3);

	a[0] = fabs(a2-a1) + fabs(a3 - a2);
	a[1] = fabs(a3-a1) + fabs(a2 - a3);
	a[2] = fabs(a1-a2) + fabs(a3 - a1);
	a[3] = fabs(a3-a2) + fabs(a1 - a3);
	a[4] = fabs(a2-a3) + fabs(a1 - a2);
	a[5] = fabs(a1-a3) + fabs(a2 - a1);

	min = a[0];

	for(i=1; i<6; i++){
		if(min > a[i]){
			min = a[i];
		}
	}

	printf("%d", min);

	return 0;

}