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 C (GCC 5.4.1) (judge verdict: Accepted)

#include <stdio.h>
#include <stdlib.h>

int main(void){
  int A[3];
  int i, j, k;
  int min = 1000;
  int cost;
  for(i = 0; i < 3; i++){
    scanf("%d", &A[i]);
  }
  for(i = 0; i < 3; i++){
    for(j = 0; j < 3; j++){
      for(k = 0; k < 3; k++){
        if(i != j && j != k && k != i){
          cost = 0 + abs(A[j] - A[i]) + abs(A[k] - A[j]);
          if(cost < min){
            min = cost;
          }
        }
      }
    }
  }
  printf("%d\n", min);
  return 0;
}