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 itertools
  
      A1,A2,A3 = map(int,input().split())
      
      vec = [A1,A2,A3]
      com = list(itertools.permutations(vec))
      
      
      all_cos = [0,0,0,0,0,0]
      for i in range(6):
          tmp_com = com[i]
          
          tmp_A1 = tmp_com[0]
          tmp_A2 = tmp_com[1]
          tmp_A3 = tmp_com[2]
          
          cos1 = 0
          cos2 = abs(tmp_A1 - tmp_A2)
          cos3 = abs(tmp_A2 - tmp_A3)
          
          all_cos[i] = cos1 + cos2 + cos3
      
      res = min(all_cos)
      print(res)
  
  
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"}]