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 Java8 (OpenJDK 1.8.0) (judge verdict: Accepted)

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

class Main{

	public static int min(int[] a)
	{
		int min = a[0];
		for (int i = 0; i < a.length; i++) {
			if(a[i]<min && a [i]!=-1)
			{	min=a[i];
				a[i]=-1;
				System.out.println(a[i]);
			}	
		}
		return min;	
	}
	
	
	public static void main(String[] args) throws IOException{
		// TODO Auto-generated method stub
		
		BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
		
		int x,y,z;
		
		String s = reader.readLine();
		String[] inp = s.split(" ");
		
		x=Integer.parseInt(inp[0]);
		y=Integer.parseInt(inp[1]);
		z=Integer.parseInt(inp[2]);
		
		int[] arr = new int[3];
		arr[0]=x;arr[1]=y;arr[2]=z;
		
		int cost=0;
		
		int a  = Math.min(x,Math.min(y,z));
				
		if(a==x)
		{
			int b = Math.max(y,z);
			cost=cost+Math.abs(b-a);
			
			cost=cost+(Math.max(y,z)-b);
			
		}
		else if(a==y)
		{
			int b = Math.max(x,z);
			cost=cost+Math.abs(b-a);
			
			cost=cost+(Math.max(x,z)-b);
			
		}
		else if(a==z)
		{
			int b = Math.max(x,y);
			cost=cost+Math.abs(b-a);
			
			cost=cost+(Math.max(x,y)-b);
		}

		System.out.println(cost);
	}

}