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 Rust (1.15.1) (judge verdict: Wrong Answer)

use std::io::BufReader;
use std::io::BufRead;
use std::io;
use std::io::prelude::*;
use std::i32;

fn main() {
    let reader = io::stdin();
    let mut reader = BufReader::new(reader.lock());
    let mut s = String::new();
    let mut costs: Vec<i32> = Vec::new();

    reader.read_line(&mut s);

    let input: Vec<i32> = s.split_whitespace().map(|s| s.parse().unwrap()).collect();

    for i in 0..3 {
        for j in 0..3 {
            for k in 0..3 {
                if i != j && j != k && k != i {
                    let x = input[i] - input[j];
                    let y = x - input[k];
                    costs.push((x.abs() + y.abs()));
                }
            }
        }
    }
    println!("{}", costs.iter().min().unwrap());
}