from math import factorial



def combination(n, r):

    return factorial(n) // (factorial(n - r) * factorial(r))



n, m = list(map(int, input().split()))

t = 100*(n-m) + m*1900 # 1回あたり

rs = [0.5**m * ( 1- 0.5**m)**i for i in range(int(1e4))]

ans = 0.0



for i,r in enumerate(rs):

    ans += ((i+1)*t)*r 

    

print((round(ans)))
N,M = list(map(int, input().split()))

p = 1/2 

print(((1900*M+100*(N-M))*2**M))

from math import factorial


def combination(n, r):
    return factorial(n) // (factorial(n - r) * factorial(r))


n, m = list(map(int, input().split()))
t = 100 * (n - m) + m * 1900  # 1回あたり
rs = [0.5**m * (1 - 0.5**m) ** i for i in range(int(1e4))]
ans = 0.0
for i, r in enumerate(rs):
    ans += ((i + 1) * t) * r
print((round(ans)))

N, M = list(map(int, input().split()))
p = 1 / 2
print(((1900 * M + 100 * (N - M)) * 2**M))

-from math import factorial - - -def combination(n, r): -    return factorial(n) // (factorial(n - r) * factorial(r)) - - -n, m = list(map(int, input().split())) -t = 100 * (n - m) + m * 1900  # 1回あたり -rs = [0.5**m * (1 - 0.5**m) ** i for i in range(int(1e4))] -ans = 0.0 -for i, r in enumerate(rs): -    ans += ((i + 1) * t) * r -print((round(ans))) +N, M = list(map(int, input().split())) +p = 1 / 2 +print(((1900 * M + 100 * (N - M)) * 2**M))