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: Aa, Ab, Ac = map(int, input().split())
  
  li = []
  
  li.append(Aa)
  li.append(Ab)
  li.append(Ac)
  
  li.sort()
  
  print(abs(li[0] - li[1]) + abs(li[1] - li[2]))
  
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"}]