#include <bits/stdc++.h>

using namespace std;

#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl

typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
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 (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = 1e18;
const ll MOD = 1000000007;
//const ll MOD = 998244353;
const double pi = 3.14159265358979323846;
#define Sp(p) cout<<setprecision(15)<< fixed<<p<<endl;
int dx[4] = { 1,0, -1,0 }, dy[4] = { 0,1,0,-1 };
int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
//#define mp make_pair


int main() {
  int n, c;
  cin >> n >> c;
  vector<pii> lw(n);
  rep (i, n) {
    cin >> lw[i].first;
  }
  rep (i, n) {
    cin >> lw[i].second;
  }
  sort(all(lw));
  for (int i = n - 1; i > 0; i--) {
    if (lw[i].first == lw[i - 1].first) {
      lw.erase(lw.begin() + i);
    }
  }
  n = lw.size();
  vector<vector<vii> > dp(c + 1, vector<vii>(n, vii(n, vi(2, -inf))));
  rep (i, n) {
    rep (j, n) {
      if (i == j) continue;
      if (lw[i].second + lw[j].second <= c) {
        dp[lw[i].second + lw[j].second][i][j][0] = lw[i].first + lw[j].first;
      }
    }
  }
  rep (i, c) {
    rep (j, n) {
      rep (k, n) {
        rep (l, n) {
          if (i + lw[l].second <= c) {
            if ((j < k && k > l && j != l) || (j > k && k < l && j != l)) {
              dp[i + lw[l].second][k][l][1] = max({dp[i + lw[l].second][k][l][1], dp[i][j][k][0] + lw[l].first, dp[i][j][k][1] + lw[l].first});
            }
          }
        }
      }
    }
  }
  int ans = 0;
  rep (i, c + 1) {
    rep (j, n) {
      rep (k, n) {
        chmax(ans, dp[i][j][k][1]);
      }
    }
  }
  cout << ans << endl;
}