from sys import stdin

import math

import bisect

import heapq

import numpy as np



n,m = [int(x) for x in stdin.readline().rstrip().split()]

print(((100*(n-m)+1900*m)*2**m))
n,m = list(map(int,input().split()))



# 全ての問題に正解する確率

all_ac = (0.5)**m



print((int((1900*m+100*(n-m))/all_ac)))
from sys import stdin
import math
import bisect
import heapq
import numpy as np

n, m = [int(x) for x in stdin.readline().rstrip().split()]
print(((100 * (n - m) + 1900 * m) * 2**m))

n, m = list(map(int, input().split()))
# 全ての問題に正解する確率
all_ac = (0.5) ** m
print((int((1900 * m + 100 * (n - m)) / all_ac)))

-from sys import stdin -import math -import bisect -import heapq -import numpy as np - -n, m = [int(x) for x in stdin.readline().rstrip().split()] -print(((100 * (n - m) + 1900 * m) * 2**m)) +n, m = list(map(int, input().split())) +# 全ての問題に正解する確率 +all_ac = (0.5) ** m +print((int((1900 * m + 100 * (n - m)) / all_ac)))