output_description: Print X, the expected value of the total execution time of the code, as an
  integer. It can be proved that, under the constraints in this problem, X is an
  integer not exceeding 10^9.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N M
attempt: # import math
  # import copy
  # import sys
  # import bisect
  # input = sys.stdin.readline
  def gcd(a, b):
      if b == 0:
          return a
      else:
          return gcd(b, a % b)
  
  
  def lcm(a, b):
      return (a * b) // gcd(a, b)
  
  
  def div(x):  # 約数配列
      div = [1]
      check = 2
      while x != 1 and check <= int(x**0.5) + 2:
          if x % check == 0:
              div.append(check)
              while x % check == 0:
                  x = x // check
          check += 1
      if x != 1:
          div.append(x)
      return div
  
  
  def div2(x):  # 素因数分解配列
      div2 = []
      check = 2
      while x != 1 and check <= int(x**0.5) + 2:
          while x % check == 0:
              div2.append(check)
              x /= check
          check += 1
      if x != 1:
          div2.append(x)
      return div2
  
  
  def main():
      # x,y = map(int,input().split())           x=1,y=2
      # a = input().split()                      a=['1','2','3',...,'n']
      # a = list(map(int,input().split()))       a=[1,2,3,4,5,...,n]
      # li = input().split('T')	              FFFTFTTFF => li=['FFF', 'F', '', 'FF']
      # 複数行の「1 2 3 4」型の入力を一配列に
      # x = sorted([list(map(int, input().split())) for _ in range(n)])
      # ソート x.sort(key=lambda y:y[1])
      # print("Yes")  print("No")  x=[[0 for _ in range(n)] for _ in range(n)]
      n, m = map(int, input().split())
      time = 1900 * m + 100 * (n - m)
      print(time * (2**m))
  
  
  main()
  
problem_description: Statement
  
  Takahashi is now competing in a programming contest, but he received TLE in a
  problem where the answer is `YES` or `NO`.
  
  When he checked the detailed status of the submission, there were N test cases
  in the problem, and the code received TLE in M of those cases.
  
  Then, he rewrote the code to correctly solve each of those M cases with 1/2
  probability in 1900 milliseconds, and correctly solve each of the other N-M
  cases without fail in 100 milliseconds.
  
  Now, he goes through the following process:
  
    * Submit the code.
    * Wait until the code finishes execution on all the cases.
    * If the code fails to correctly solve some of the M cases, submit it again.
    * Repeat until the code correctly solve all the cases in one submission.
  
  Let the expected value of the total execution time of the code be X
  milliseconds. Print X (as an integer).
samples: [{"input": "1 1", "output": "3800\n    \n\nIn this input, there is only one case. Takahashi will repeatedly submit the\ncode that correctly solves this case with 1/2 probability in 1900\nmilliseconds.\n\nThe code will succeed in one attempt with 1/2 probability, in two attempts\nwith 1/4 probability, and in three attempts with 1/8 probability, and so on.\n\nThus, the answer is 1900 \\times 1/2 + (2 \\times 1900) \\times 1/4 + (3 \\times\n1900) \\times 1/8 + ... = 3800.\n\n* * *"}, {"input": "10 2", "output": "18400\n    \n\nThe code will take 1900 milliseconds in each of the 2 cases, and 100\nmilliseconds in each of the 10-2=8 cases. The probability of the code\ncorrectly solving all the cases is 1/2 \\times 1/2 = 1/4.\n\n* * *"}, {"input": "100 5", "output": "608000"}]