import sys

from collections import defaultdict, Counter

from itertools import product, groupby, count, permutations, combinations

from math import pi, sqrt, ceil, floor

from collections import deque

from bisect import bisect, bisect_left, bisect_right

from string import ascii_lowercase

INF = float("inf")

sys.setrecursionlimit(10**7)



# 4近傍（右, 下, 左, 上）

dy = [0, -1, 0, 1]

dx = [1, 0, -1, 0]





def inside(y: int, x: int, H: int, W: int) -> bool: return 0 <= y < H and 0 <= x < W





def main():

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

    ans = 0

    ans += (2 ** M) * ((1900 * M) + (N - M) * 100)

    print(ans)





if __name__ == '__main__':

    main()

import sys

from collections import defaultdict, Counter

from itertools import product, groupby, count, permutations, combinations

from math import pi, sqrt, ceil, floor

from collections import deque

from bisect import bisect, bisect_left, bisect_right

from string import ascii_lowercase

INF = float("inf")

sys.setrecursionlimit(10**7)



# 4近傍（右, 下, 左, 上）

dy = [0, -1, 0, 1]

dx = [1, 0, -1, 0]





def inside(y: int, x: int, H: int, W: int) -> bool: return 0 <= y < H and 0 <= x < W





def main():

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

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





if __name__ == '__main__':

    main()

import sys
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt, ceil, floor
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase

INF = float("inf")
sys.setrecursionlimit(10**7)
# 4近傍（右, 下, 左, 上）
dy = [0, -1, 0, 1]
dx = [1, 0, -1, 0]


def inside(y: int, x: int, H: int, W: int) -> bool:
    return 0 <= y < H and 0 <= x < W


def main():
    N, M = list(map(int, input().split()))
    ans = 0
    ans += (2**M) * ((1900 * M) + (N - M) * 100)
    print(ans)


if __name__ == "__main__":
    main()

import sys
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt, ceil, floor
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase

INF = float("inf")
sys.setrecursionlimit(10**7)
# 4近傍（右, 下, 左, 上）
dy = [0, -1, 0, 1]
dx = [1, 0, -1, 0]


def inside(y: int, x: int, H: int, W: int) -> bool:
    return 0 <= y < H and 0 <= x < W


def main():
    N, M = list(map(int, input().split()))
    print((2**M * (M * 1900 + (N - M) * 100)))


if __name__ == "__main__":
    main()

-    ans = 0 -    ans += (2**M) * ((1900 * M) + (N - M) * 100) -    print(ans) +    print((2**M * (M * 1900 + (N - M) * 100)))