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: #!/usr/bin/env python3
  
  import sys
  import math
  from bisect import bisect_right as br
  from bisect import bisect_left as bl
  
  sys.setrecursionlimit(2147483647)
  from heapq import heappush, heappop, heappushpop
  from collections import defaultdict
  from itertools import accumulate
  from collections import Counter
  from collections import deque
  from operator import itemgetter
  from itertools import permutations
  
  mod = 10**9 + 7
  inf = float("inf")
  
  
  def I():
      return int(sys.stdin.readline())
  
  
  def LI():
      return list(map(int, sys.stdin.readline().split()))
  
  
  a = LI()
  a.sort(reverse=1)
  ans = a[0] - a[2]
  print(ans)
  
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"}]