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: Wrong Answer)

function sort(x) {
  args = x;
  continue2 = true;
  while (continue2) {
    continue2 = false;
    var j_end = args.length - 1;
    var j_inc = 1;
    if (1 > j_end) {
      j_inc = -j_inc;
    }
    for (j = 1; j_inc >= 0 ? j <= j_end : j >= j_end; j += j_inc) {
      cur = args[(j - 1)];
      next = args[((j + 1) - 1)];
      if (next < cur) {
        args[(j - 1)] = next;
        args[((j + 1) - 1)] = cur;
        if (j < args.length - 1) {
          continue2 = true;
        }
      }
    }
  }
  return args;
}

function main(input) {
  sorted = sort(input.split(' '));
  result = 0;
  var i_end = sorted.length - 1;
  var i_inc = 1;
  if (1 > i_end) {
    i_inc = -i_inc;
  }
  for (i = 1; i_inc >= 0 ? i <= i_end : i >= i_end; i += i_inc) {
    cur = sorted[(i - 1)];
    next = sorted[((i + 1) - 1)];
    result = result + Math.abs(cur - next);
  }
  console.log(result);
}

main(require('fs').readFileSync('/dev/stdin', 'utf8'));