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: Runtime Error)

#include <stdio.h>

int absolute(int a,int b)
{
	int c;
	if (a < b) {
		c = b - a;
		return c;
	}

	else {
		c = a - b;
		return c;
	}
}

void bsort(int a[], int n)
{
	int i, j;

	for (i = 0; i < n - 1; i++) {
		for(j=n-1;j>i;j--)
			if (a[j - 1] > a[j]) {
				int temp = a[j];
				a[j] = a[j - 1];
				a[j - 1] = temp;
			}
	}
}

int main(void)
{
	int A[2];
	int i,answer;

	for (i = 0; i <= 2; i++) {
		scanf("%d", &A[i]);
	}

	bsort(A[2], 3);
	
	answer = absolute(A[0], A[1]) +absolute(A[2], A[1]);
	
	printf("%d", answer);

	return 0;
}