def kadomatsu(a, b, c):
    if a == b or b == c or c == a:
        return False
    if a < b < c or a > b > c:
        return False
    return True

N, C = map(int, input().split())
L = list(map(int, input().split()))
W = list(map(int, input().split()))
M = 50
ans = 0
inf = 10 ** 18
dp = [[[-inf] * (M + 1) for i in range(M + 1)] for j in range(C + 1)] 
for i in range(N):
    for j in range(N):
        for k in range(N):
            if not kadomatsu(L[i], L[j], L[k]):
                continue
            if W[i] + W[j] + W[k] > C:
                continue
            dp[W[i] + W[j] + W[k]][L[j]][L[k]] = max(dp[W[i] + W[j] + W[k]][L[j]][L[k]], L[i] + L[j] + L[k])

for c in range(C + 1):
    for a in range(M + 1):
        for b in range(M + 1):
            if dp[c][a][b] == -inf:
                continue
            for i in range(N):
                if not kadomatsu(a, b, L[i]):
                    continue
                if c + W[i] > C:
                    continue
                dp[c + W[i]][b][L[i]] = max(dp[c + W[i]][b][L[i]], dp[c][a][b] + L[i])
            ans = max(ans, dp[c][a][b])

print(ans)