#include <bits/stdc++.h>
using namespace std;

int dp[51][51][51];

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N, C;
    cin >> N >> C;
    vector<int> Ls(N, 0);
    vector<int> Ws(N, 0);
    for (auto & l: Ls) cin >> l;
    int L = *max_element(Ls.begin(), Ls.end());
    for (auto & w: Ws) cin >> w;
    for (int c = 0; c <= C; ++c){
        for (int a = 0; a <= 50; ++a){
            for (int b = 0; b <= 50; ++b){
                dp[c][a][b] = 0;
            }
        }
    }
    for (int i = 0; i < N; ++i){
        for (int j = 0; j < N; ++j){
            if (Ls[i] == Ls[j]) continue;
            int c = Ws[i] + Ws[j];
            if (c > C) continue;
            for (int k = 0; k < N; ++k){
                if (Ls[i] == Ls[k] or Ls[j] == Ls[k]) continue;
                if (Ls[i] > Ls[j] and Ls[j] > Ls[k]) continue;
                if (Ls[i] < Ls[j] and Ls[j] < Ls[k]) continue;
                if (c + Ws[k] > C) continue;
                if (dp[c + Ws[k]][Ls[k]][Ls[j]] < Ls[i] + Ls[j] + Ls[k]){
                    dp[c + Ws[k]][Ls[k]][Ls[j]] = Ls[i] + Ls[j] + Ls[k];
                }
            }
        }
    }
    for (int c = 1; c < C; ++c){
        for (int a = 1; a <= L; ++a){
            for (int b = 1; b <= L; ++b){
                if (dp[c][a][b] == 0) continue;
                for (int i = 0; i < N; ++i){
                    if (c + Ws[i] > C) continue;
                    if (a == Ls[i] or b == Ls[i]) continue;
                    if (Ls[i] > a and a > b) continue;
                    if (Ls[i] < a and a < b) continue;
                    dp[c + Ws[i]][Ls[i]][a] = max(dp[c + Ws[i]][Ls[i]][a], dp[c][a][b] + Ls[i]);
                }
            }
        }
    }
    int ans = 0;
    for (int c = 1; c <= C; ++c){
        for (int a = 1; a <= L; ++a){
            for (int b = 1; b <= L; ++b){
                ans = max(ans, dp[c][a][b]);
            }
        }
    }
    cout << ans << endl;
    return 0;
}