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: Runtime Error)

#include<stdio.h>

void main()
{
	int A1, A2, A3,mini, cost = 0;

	cost=scanf("%d %d %d", &A1, &A2, &A3);

	if (A2 <= A1) 
	{
		mini = A2;
		A2 = A1;
		A1 = mini;
	}
	//前2个完成排序
	//printf("%d %d\n", A1, A2);
	if (A3 <= A1)//A3最小
	{
		mini = A3;
		A3 = A2;A2 = A1;A1 = mini;
	}
	else
		if (A3 <= A2) //A3第二小
		{
			mini = A3;
			A3 = A2;
			A2 = mini;
		}
	//printf("%d %d %d\n", A1, A2, A3);
	cost = A3 - A1;
	printf("%d", cost);
}