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 (Clang 3.8.0) (judge verdict: Accepted)

#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#include <inttypes.h>
#include <stdint.h>
#include <string.h>
#include <wchar.h>

#define MIN(a, b) (a < b ? a : b)
#define MAX(a, b) (a > b ? a : b)
#define ABSS(a, b) (a > b ? a - b : b - a)

int main(void) {
	uint32_t A[3];

	scanf("%"PRIu32" %"PRIu32" %"PRIu32, &A[0], &A[1], &A[2]);

	uint32_t min = ABSS(A[0], A[1]) + ABSS(A[1], A[2]);
	uint32_t cost = ABSS(A[0], A[2]) + ABSS(A[2], A[1]);
	if (cost < min) {
		min = cost;
	}
	cost = ABSS(A[1], A[0]) + ABSS(A[0], A[2]);
	if (cost < min) {
		min = cost;
	}
	cost = ABSS(A[1], A[2]) + ABSS(A[2], A[0]);
	if (cost < min) {
		min = cost;
	}
	cost = ABSS(A[2], A[0]) + ABSS(A[0], A[1]);
	if (cost < min) {
		min = cost;
	}
	cost = ABSS(A[2], A[1]) + ABSS(A[1], A[0]);
	if (cost < min) {
		min = cost;
	}

	printf("%"PRIu32, min);

	return 0;
}