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).
N, M = map(int, input().split())

T = (N-M)*100 + M*1900
a = (1-2**(-M))

ans = 2**(-M)*T//(1-a)**2

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

T = (N-M)*100 + M*1900
a = (1-2**(-M))

ans = 2**(-M)*T//((1-a)**2)

print(int(ans))