import bisect
import copy
import decimal
import fractions
import functools
import heapq
import itertools
import math
import random
import sys
from collections import Counter,deque,defaultdict
from functools import lru_cache,reduce
from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max
def _heappush_max(heap,item):
    heap.append(item)
    heapq._siftdown_max(heap, 0, len(heap)-1)
def _heappushpop_max(heap, item):
    if heap and item < heap[0]:
        item, heap[0] = heap[0], item
        heapq._siftup_max(heap, 0)
    return item
from math import gcd as GCD
read=sys.stdin.read
readline=sys.stdin.readline
readlines=sys.stdin.readlines

C,D=map(int,readline().split())
ans=0
B=(D*84-C*28)/52
A=(C*28-B*8)/21
if A>=0 and B>=0:
    ans=max(ans,A*1000+B*2000)
A=min(C*4/3,D*4)
B=min(C*7/2,D*7/5)
ans=max(ans,A*1000,B*2000)
print(ans)