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

#include <stdio.h>
#include <string.h>

void skip(char str[]){
    int i;
    int x = strlen(str);
    char l = str[0];
    char buf[100];
    for(i=0;i<x;i++){
        buf[i] = str[i+1];
    }
    buf[x-1] = l;
    strcpy(str,buf);
}

int main(void){
    char s[100];
    char t[100];
    int i = 0;
    scanf("%s %s",s,t);
    for(i=0;i<100;i++){
        if(strcmp(s,t)==0){
            printf("Yes");
            return 0;
        }else{
            skip(s);
        }
    }
    printf("No");


    return 0;
}