import sys

sys.setrecursionlimit(10**6)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.buffer.readline())
def MI(): return map(int, sys.stdin.buffer.readline().split())
def MI1(): return map(int1, sys.stdin.buffer.readline().split())
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def LI1(): return list(map(int1, sys.stdin.buffer.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def BI(): return sys.stdin.buffer.readline().rstrip()
def SI(): return sys.stdin.buffer.readline().rstrip().decode()
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
inf = 10**16
# md = 998244353
# md = 10**9+7

n, c = MI()
ll = LI()
ww = LI()

# dp[i][j][k]...i金額、j,k最後の2本

dp = [[[-1]*51 for _ in range(51)] for _ in range(c+1)]

def chmax(i, j, k, val, update=False):
    global ans
    if i > c or j > 50 or k > 50: return
    if val > dp[i][j][k]:
        dp[i][j][k] = val
        if update: ans = max(ans, val)

ans = -1
dp[0][0][0] = 0
for i in range(c):
    for j in range(51):
        for k in range(51):
            pre = dp[i][j][k]
            if pre == -1: continue
            for l, w in zip(ll, ww):
                if k == 0: chmax(i+w, j, l, l)
                elif j == 0:
                    if l != k: chmax(i+w, k, l, pre+l)
                elif j < k:
                    if l < k and l != j:
                        chmax(i+w, k, l, pre+l, True)
                else:
                    if l > k and l != j:
                        chmax(i+w, k, l, pre+l, True)

print(0 if ans == -1 else ans)