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.util.*;
public class Main {
public static void main(String[] args){
Scanner sc = new Scanner(System.in);


int[] A=new int[3];
A[0]=Integer.parseInt(sc.next());
A[1]=Integer.parseInt(sc.next());
A[2]=Integer.parseInt(sc.next());
int a=Math.abs(A[1]-A[0])+Math.abs(A[2]-A[1]);
int b=Math.abs(A[2]-A[0])+Math.abs(A[1]-A[2]);
int ans=Math.min(a, b);
int c=Math.abs(A[2]-A[1])+Math.abs(A[0]-A[2]);
ans=Math.min(ans,c);
int d=Math.abs(A[0]-A[1])+Math.abs(A[2]-A[0]);
ans=Math.min(ans, d);
int e=Math.abs(A[1]-A[2])+Math.abs(A[0]-A[1]);
ans=Math.min(ans, e);
int f=Math.abs(A[0]-A[2])+Math.abs(A[1]-A[0]);
ans=Math.min(ans,f);
System.out.println(ans);


}}