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 Kotlin (1.0.0) (judge verdict: Accepted)

import java.util.Scanner

fun main(args:Array<String>){
    val scanner=Scanner(System.`in`)

    var a=IntArray(3)
    var x:Int=0
    var y=0
    var z=0
    var n=0
    var sum=0

    for (i in 0..2){
        a[i]=scanner.nextInt()
    }

    for (j in 0..2){
        if (x<a[j]){
            x=a[j]
            n=j
        }
    }

    var d=(n+2)%3
    var e=(n+1)%3

    if (a[d]<a[e]){
        y=a[e]
        z=a[d]
    }
    else{
        y=a[d]
        z=a[e]
    }

    var sa1=x-y
    var sa2=y-z

    if (sa1<0) sa1=sa1*-1
    if (sa2<0) sa2=sa2*-1

    sum=sa1+sa2
    println(sum)
}