#include <bits/stdc++.h>

using namespace std;

#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)
#define unless(p) if(!(p))
#define until(p) while(!(p))

using ll = long long;
using P = std::tuple<int,int>;

const int dx[8] = {-1, 1, 0, 0, -1, -1, 1, 1}, dy[8] = {0, 0, -1, 1, -1, 1, -1, 1};

int N, C;
int L[60], W[60];
int dp[60][60][60]; // 残金, 2つ前, 1つ前

bool isKadomatsu(int i, int j, int k){
    int s = std::min({L[i], L[j], L[k]}),
        u = std::max({L[i], L[j], L[k]}),
        t = (L[i] + L[j] + L[k]) - (s + u);
    return s != t && t != u && (L[j] == s || L[j] == u);
}

int rec(int rem, int p2, int p1){
    if(dp[rem][p2][p1] != -1){
        return dp[rem][p2][p1];
    }

    int mx = 0;
    for(int i=0;i<N;++i){
        if(W[i] <= rem && isKadomatsu(p2, p1, i)){
            mx = std::max(mx, rec(rem - W[i], p1, i) + L[i]);
        }
    }

    return dp[rem][p2][p1] = mx;
}

int main(){
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    std::cin >> N >> C;

    for(int i=0;i<N;++i){
        std::cin >> L[i];
    }

    for(int i=0;i<N;++i){
        std::cin >> W[i];
    }

    memset(dp, -1, sizeof(dp));

    int res = 0;
    for(int i=0;i<N;++i){
        for(int j=0;j<N;++j){
            if(i == j){continue;}

            for(int k=0;k<N;++k){
                if(i == k || j == k){continue;}

                int cost = W[i] + W[j] + W[k], len = L[i] + L[j] + L[k];
                if(cost <= C && isKadomatsu(i, j, k)){
                    res = std::max(res, rec(C - cost, j, k) + len);
                }
            }
        }
    }

    std::cout << res << std::endl;
}