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 PHP7 (7.0.15) (judge verdict: Wrong Answer)

<?php
class node
{
    public $a;
    public $b;
    public function __construct($var1,$var2)
    {
        $this->a = $var1;
        $this->b = $var2;
    }
}
$arr = array();
fscanf(STDIN,"%d %d",$N,$M);
for($i = 0;$i < $M;$i++)
{
    fscanf(STDIN,"%d %d",$a,$b);
    if(!isset($arr[$b]))
       $arr[$b] = $a;
    else{
        $arr[$b] = max($arr[$b],$a);
    }
}
$len = count($array);
if($len === 0)
{
    echo "0\n";
}
else 
{
    $cnt = 0;
    $maxx = -2;
    ksort($arr);
    foreach($arr as $key=>$value)
    {
      if($maxx < $value)
      {
        $maxx = $key-1;
        $cnt++;
      }
    }
    echo $cnt."\n";
}