#include <bits/stdc++.h>
#define ft first
#define sc second
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pt(sth) cout << sth << "\n"
#define chmax(a, b) {if(a<b) a=b;}
#define chmin(a, b) {if(a>b) a=b;}
#define moC(a, s, b) (a)=((a)s(b)+MOD)%MOD
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
static const ll INF=1e18;
static const ll MAX=1e5+7;
static const ll MOD=1e9+7;
ll max(ll a, ll b) {return a>b?a:b;}
ll min(ll a, ll b) {return a<b?a:b;}



ll dp[55][55][55];

int main(void) {
  ll N, C;
  cin >> N >> C;
  ll l[55], w[55];
  ll i, j, k, m;
  
  for(i=0; i<N; i++) cin >> l[i];
  for(i=0; i<N; i++) cin >> w[i];
  
  for(i=0; i<N; i++) {
    for(j=0; j<N; j++) {
      for(k=0; k<N; k++) {
        if(!((l[i]<l[j] && l[j]>l[k] && l[i]!=l[k]) || (l[i]>l[j] && l[j]<l[k] && l[i]!=l[k]))) continue;
        if(w[i]+w[j]+w[k]>C) continue;
        chmax(dp[w[i]+w[j]+w[k]][i][j], l[i]+l[j]+l[k]);
      }
    }
  }
  
  
  for(m=0; m<C; m++) {
    for(i=0; i<N; i++) {
      for(j=0; j<N; j++) {
        for(k=0; k<N; k++) {
          if(dp[m][i][j]==0) continue;
          if(!((l[i]<l[j] && l[j]>l[k] && l[i]!=l[k]) || (l[i]>l[j] && l[j]<l[k] && l[i]!=l[k]))) continue;
          if(m+w[k]>C) continue;
          chmax(dp[m+w[k]][j][k], dp[m][i][j]+l[k]);
        }
      }
    }
  }
  
  ll ans=0;
  for(k=0; k<=C; k++) {
    for(i=0; i<N; i++) {
      for(j=0; j<N; j++) {
        chmax(ans, dp[k][i][j]);
      }
    }
  }
  
  pt(ans);
}