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

/* macro */
#define rep(i,a,b) for(int i=a;i<b;i++)
#define revrep(i,a,b) for(int i = a; i > b; i--)
#define int long long
#define exist(s,e) ((s).find(e)!=(s).end())
#define all(v) (v).begin(), (v).end()
#define each(s,itr) for(auto (itr) = s.begin(); (itr) != s.end(); (itr)++)
#define sum(v) accumulate(all(v), (0LL))
#define pb push_back


/* alias */
template<class T> using vec = vector<T>;
typedef vector<int> vi;
typedef pair<int, int> pi;


/* constant */
const int inf = 1000100010010010;
const int mod = 1e9 + 7;
int dx[8]={1,0,-1,0,-1,1,-1,1};
int dy[8]={0,1,0,-1,-1,-1,1,1};


/* io_method */
int input(){int tmp;cin >> tmp;return tmp;}
string raw_input(){string tmp;cin >> tmp;return tmp;}
string readline(){string s;getline(cin, s);return s;}
template<class T> void printx(T n){cout << n;}
template<class T, class U> void printx(pair<T, U> p){cout << "(" << p.first << "," << p.second << ")";}
template<class T> void printx(vector<T> v){cout << "{";rep(i,0,v.size()){printx(v[i]);if(i != v.size()-1)printx(",");}cout << "}";}
template<class T> void print(T n){printx(n);cout << endl;}
template<class T> void print(set<T> s){cout << "{";each(s, e){if(e != s.begin()) printx(",");printx(*e);}cout << "}" << endl;}
template<class T, class U> void print(map<T, U> mp){cout << "{";each(mp, e){cout << "(" << e -> first << "," << e -> second << ")";}cout << "}" << endl;}


/* general_method */
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
//template<class T>auto cut(T &a, int l, int r){return T(a.begin()+l, a.begin()+r);}

/* main */

int n, c;
vi l;
vi w;

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

int dfs(int rest, int h, int prev, int nxt){

    if(dp[rest][h][prev][nxt] > -1) return dp[rest][h][prev][nxt];

    int ans = 0;

    rep(i,0,n){
        if(w[i] > rest) continue;
        if(l[i] == prev) continue;
        if(nxt == 1 && l[i] > h){
            chmax(ans, l[i] + dfs(rest - w[i], l[i], h, 2));
        }else if(nxt == 2 && l[i] < h){
            chmax(ans, l[i] + dfs(rest - w[i], l[i], h, 1));
        }else if(nxt == 0){
            chmax(ans, l[i] + dfs(rest - w[i], l[i], -1, 1));
            chmax(ans, l[i] + dfs(rest - w[i], l[i], -1, 2));
        }
    }

    return dp[rest][h][prev][nxt] = ans;


}




signed main(){


    cin.tie(0);
    ios::sync_with_stdio(false);

    cin >> n >> c;
    rep(i,0,n) l.push_back(input());
    rep(i,0,n) w.push_back(input());
    memset(dp, -1, sizeof(dp));

    map<int, int> mp;
    rep(i,0,n){
        if(not exist(mp, l[i])){
            mp[l[i]] = w[i];
        }else{
            chmin(mp[l[i]], w[i]);
        }
    }
    l.clear();
    w.clear();

    each(mp, itr){
        l.push_back(itr -> first);
        w.push_back(itr -> second);
    }
    if(l.size() < 3){
        print(0);
        return 0;
    }

    vi hoge = w;
    sort(all(w));
    if(hoge[0] + hoge[1] + hoge[2] > c){
        print(0);
        return 0;
    }

    print(dfs(c, -1, -1, 0));

    








    



    


    

}