output_description: Print the minimum total cost required to complete all the task.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      A_1 A_2 A_3
attempt: import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, copy, functools
  
  sys.setrecursionlimit(10**7)
  inf = 10**20
  eps = 1.0 / 10**10
  mod = 10**9 + 7
  dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
  ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]
  
  
  def LI():
      return [int(x) for x in sys.stdin.readline().split()]
  
  
  def LI_():
      return [int(x) - 1 for x in sys.stdin.readline().split()]
  
  
  def LF():
      return [float(x) for x in sys.stdin.readline().split()]
  
  
  def LS():
      return sys.stdin.readline().split()
  
  
  def I():
      return int(sys.stdin.readline())
  
  
  def F():
      return float(sys.stdin.readline())
  
  
  def S():
      return input()
  
  
  def pf(s):
      return print(s, flush=True)
  
  
  def main():
      a = sorted(LI())
      return a[-1] - a[0]
  
  
  print(main())
  
problem_description: 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.
samples: [{"input": "1 6 3", "output": "5\n    \n\nWhen the tasks are completed in the following order, the total cost will be 5,\nwhich is the minimum:\n\n  * Complete the first task at cost 0.\n  * Complete the third task at cost 2.\n  * Complete the second task at cost 3.\n\n* * *"}, {"input": "11 5 5", "output": "6\n    \n\n* * *"}, {"input": "100 100 100", "output": "0"}]