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 Java7 (OpenJDK 1.7.0) (judge verdict: Accepted)



import java.util.Scanner;

public class Main {

	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);

		int a = sc.nextInt();
		int b = sc.nextInt();
		int c = sc.nextInt();

		int cost = 10000;
		int p1 = Math.abs(a - b) + Math.abs(b - c);
		if (p1 < cost) {
			cost = p1;
		}
		int p2 = Math.abs(a - c) + Math.abs(b - c);
		if (p2 < cost) {
			cost = p2;
		}
		int p3 = Math.abs(b - a) + Math.abs(a - c);
		if (p3 < cost) {
			cost = p3;
		}
		int p4 = Math.abs(b - c) + Math.abs(a - c);
		if (p4 < cost) {
			cost = p4;
		}
		int p5 = Math.abs(c - b) + Math.abs(b - a);
		if (p5 < cost) {
			cost = p5;
		}
		int p6 = Math.abs(c - a) + Math.abs(a - b);
		if (p6 < cost) {
			cost = p6;
		}
		System.out.println(cost);
	}
}