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 max, min, mid, i, j, k, x, y, z, sum;
	
	scanf("%d %d %d", &x, &y, &z);
	
	if(x>=y && x>=z){
		max = x;
	}
	
	else if(y>=x && y>=z){
		max = y;
	}
	else if(z>=x && z>= y){
		max = z;
	}
	
	if(max==x){
		if(y>=z){
			mid = y;
			min =z;
		}
		
		else{
			mid = z;
			min = y;
		}
	}
	
	if(max == y){
		if(x>=z){
			mid = x;
			min = z;
		}
		else{
			mid = z;
			min = x;
		}
	}
	
	if(max==z){
		if(x>=y){
			mid = x;
			min = y;
		}
		else{
			mid = y;
			min = x;
		}	
	}
	 
	 sum = (max-mid) + (mid-min);
	 
	 printf("%d\n", sum);
	 
	 return 0;

}