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()
{
	int A[3];
	int a,b,c;
	int N[3];
	scanf("%d %d %d",&A[0],&A[1],&A[2]);
	a=A[0]-A[1];
	b=A[0]-A[2];
	c=A[2]-A[1];
	if(a<0){
		a=-a;
	}
	if(b<0){
		b=-b;
	}
	if(c<0){
		c=-c;
	}
	N[0]=a+b;
	N[1]=b+c;
	N[2]=c+a;
	if(N[0]<N[1]){
		if(N[0]<N[2]){
			printf("%d",N[0]);
		}else{
			printf("%d",N[2]);
		}
	}else{
		if(N[1]<N[2]){
			printf("%d",N[1]);
		}else{
			printf("%d",N[2]);
		}
	}
	return 0;
}