#include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
#define repr(i, a, b) for(int i = a; i >= b; i--)
#define int long long
#define all(a) a.begin(), a.end()
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
typedef pair<int, int> P;
const int mod = 1000000007;
const int INF = 1e18;

int dp[52][52][52], nxt[52][52][52];

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, c;
    cin >> n >> c;
    vector<int> l(n), w(n);
    rep(i, 0, n) cin >> l[i];
    rep(i, 0, n) cin >> w[i];
    rep(i, 0, 52) rep(j, 0, 52) rep(k, 0, 52) dp[i][j][k] = -1;
    dp[0][0][0] = 0;
    int ans = 0;
    rep(i, 0, c){
        rep(j, 0, 52) rep(k, 0, 52) rep(m, 0, 52) nxt[j][k][m] = -1;
        rep(j, 0, c){
            rep(k, 0, 52){
                rep(m, 0, 52){
                    if(dp[j][k][m] == -1) continue;
                    rep(p, 0, n){
                        if(max({k, m, l[p]}) == m || min({k, m, l[p]}) == m || i < 2){
                            if((k != m && m != l[p] && k != l[p]) || i < 2){
                                if(j + w[p] <= c){
                                    nxt[j + w[p]][m][l[p]] = max(nxt[j + w[p]][m][l[p]], dp[j][k][m] + l[p]);
                                }
                            }
                        }
                    }
                }
            }
        }
        swap(dp, nxt);
        if(i >= 2){
            rep(j, 0, c + 1){
                rep(k, 1, 52){
                    rep(m, 1, 52){
                        ans = max(ans, dp[j][k][m]);
                    }
                }
            }
        }
    }
    cout << ans << endl;
}