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>
#include <stdlib.h>

int main(void)
{
  char s[100],t[100],tmp;
  if(scanf("%s",s)<0) exit(1);
  if(scanf("%s",t)<0) exit(1);

// fgets(s,100,stdin);
// fgets(t,100,stdin);
  int i,j;
//  printf("%lu",strlen(s));


   for(i=0;i<strlen(s)-1;i++)
  {
    if(strcmp(s,t)==0)
    {
      break;
    }
    else
    {
      tmp=s[0];
      for(j=0;j<strlen(s)-1;j++)
      {
        s[j]=s[j+1];
      }
      s[strlen(s)-1]=tmp;
    }
  }

  if(strcmp(s,t)==0)
  {
    printf("Yes\n");
  }
  else printf("No\n");

  return 0;
}