output_description: Print the largest possible sum of the integers written on the blackboard after
  K operations by E869220.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      A B C
      K
attempt: A,B,C = map(int,input().split())
  K = int(input())
  L = max(A,B,C)
  if L ==A:
  print((A*(2**K))+B+C
  elif L ==B:
  print(A+(B*(2**K))+C)
  else:
  print(A+B+(C*(2**K)))
problem_description: Statement
  
  There are three positive integers A, B and C written on a blackboard. E869120
  performs the following operation K times:
  
    * Choose one integer written on the blackboard and let the chosen integer be n. Replace the chosen integer with 2n.
  
  What is the largest possible sum of the integers written on the blackboard
  after K operations?
samples: [{"input": "5 3 11\n    1", "output": "30\n    \n\nIn this sample, 5, 3, 11 are initially written on the blackboard, and E869120\ncan perform the operation once.  \nThere are three choices:\n\n  1. Double 5: The integers written on the board after the operation are 10, 3, 11.\n  2. Double 3: The integers written on the board after the operation are 5, 6, 11.\n  3. Double 11: The integers written on the board after the operation are 5, 3, 22.\n\nIf he chooses 3., the sum of the integers written on the board afterwards is 5\n+ 3 + 22 = 30, which is the largest among 1. through 3.\n\n* * *"}, {"input": "3 3 4\n    2", "output": "22\n    \n\nE869120 can perform the operation twice. The sum of the integers eventually\nwritten on the blackboard is maximized as follows:\n\n  * First, double 4. The integers written on the board are now 3, 3, 8. \n  * Next, double 8. The integers written on the board are now 3, 3, 16. \n\nThen, the sum of the integers eventually written on the blackboard is 3 + 3 +\n16 = 22."}]