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

total_time = M*1900+(N-M)*100



e = 0

err = 10**(-3)

prev = -100

i = 0

while abs(prev-e) > err:

    prev = e

    e += (1-(1/2)**M)**i*(1/2)**M*total_time*(i+1)

    i += 1





def floor(x, y):

    return ((-x)//y)*(-1)





print((int(floor(e, 1))))

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



# 一回の思考にかかる時間

total_time = M*1900+(N-M)*100



e = 0

err = 10**(-3)  # 許容誤差(答えが整数だから、いい感じに近くなったら打ち切って、四捨五入)

prev = -1

i = 0



while abs(prev-e) > err:

    prev = e

    e += (1-(1/2)**M)**i*(1/2)**M*total_time*(i+1)

    i += 1





def floor(x, y):

    return ((-x)//y)*(-1)





print((int(floor(e, 1))))



N, M = list(map(int, input().split()))
total_time = M * 1900 + (N - M) * 100
e = 0
err = 10 ** (-3)
prev = -100
i = 0
while abs(prev - e) > err:
    prev = e
    e += (1 - (1 / 2) ** M) ** i * (1 / 2) ** M * total_time * (i + 1)
    i += 1


def floor(x, y):
    return ((-x) // y) * (-1)


print((int(floor(e, 1))))

N, M = list(map(int, input().split()))
# 一回の思考にかかる時間
total_time = M * 1900 + (N - M) * 100
e = 0
err = 10 ** (-3)  # 許容誤差(答えが整数だから、いい感じに近くなったら打ち切って、四捨五入)
prev = -1
i = 0
while abs(prev - e) > err:
    prev = e
    e += (1 - (1 / 2) ** M) ** i * (1 / 2) ** M * total_time * (i + 1)
    i += 1


def floor(x, y):
    return ((-x) // y) * (-1)


print((int(floor(e, 1))))

+# 一回の思考にかかる時間 -err = 10 ** (-3) -prev = -100 +err = 10 ** (-3)  # 許容誤差(答えが整数だから、いい感じに近くなったら打ち切って、四捨五入) +prev = -1