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 JavaScript (node.js v5.12) (judge verdict: Accepted)

function f(x, y, z){ return Math.abs(y - x) + Math.abs(y - z); }
function main(input){
	input = input.split(' ').map(Number);
	a = input[0], b = input[1], c = input[2], d = 1000001;
	if (f(a, b, c) < d) d = f(a, b, c);
	if (f(a, c, b) < d) d = f(a, c, b);
	if (f(b, a, c) < d) d = f(b, a, c);
	if (f(b, c, a) < d) d = f(b, c, a);
	if (f(c, a, b) < d) d = f(c, a, b);
	if (f(c, b, a) < d) d = f(c, b, a);
	console.log(d);
}
main(require("fs").readFileSync("/dev/stdin", "utf8"));