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).
def solve(n, m):

    ans = ((n-m) * 100 + 1900 * m) * 2 ** m

    return ans

if __name__ == "__main__":
    n, m = [int(i) for i in input().split()]
    solve(n, m)
def solve(n, m):

    ans = ((n-m) * 100 + 1900 * m) * 2 ** m
    return ans

if __name__ == "__main__":
    n, m = [int(i) for i in input().split()]
    print(solve(n, m))