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.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		// A1-A3を受け付ける
		int a[] = new int[3];
		for (int i = 0; i < a.length; i++) {
			a[i] = sc.nextInt();
		}
		// 3通りの絶対値を格納する配列Xを作成する

		int x[] = new int[3];
		x[0] = Math.abs(a[0] - a[1]);
		x[1] = Math.abs(a[1] - a[2]);
		x[2] = Math.abs(a[2] - a[0]);
		// 3通りの絶対値を合計する
		int sum = 0;
		for (int i = 0; i < x.length; i++) {
			sum += x[i];
		}
		// 3通りの中で最も大きいものを合計から引く
		int max1 = Math.max(x[0], x[1]);
		int trueMax = Math.max(max1, x[2]);
		int min_cost = sum - trueMax;
		// 最低コストmin_costを出力する
		System.out.println(min_cost);
	}
}