// includes
#include <cstdio>
#include <cstdint>
#include <iostream>
#include <iomanip>
#include <string>
#include <queue>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <utility>
#include <functional>
#include <cmath>
#include <climits>
#include <bitset>
#include <list>
#include <random>

// macros
#define ll long long int
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())

using namespace std;

//  types
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
typedef pair<double, double> Pd;
 
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1e9 + 7;

// solve
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;}

int l[51], w[51];
ll dp[51][51][51];
bool ok[51][51][101];
int t[51];

int main(int argc, char const* argv[])
{
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int n, c;
  cin >> n >> c;
  rep(i, n)cin >> l[i];
  rep(i, n)cin >> w[i];
  rep(i, n){
    if(t[l[i]] == 0 || t[l[i]] > w[i])t[l[i]] = w[i];
  }
  for(int i = 0; i < n; i++){
    for(int j = 0; j < n; j++){
      if(l[i] != l[j] && w[i] + w[j] <= c){
        dp[l[i]][l[j]][w[i]+w[j]] = max(dp[l[i]][l[j]][w[i]+w[j]], (ll)l[i] + l[j]);
        dp[l[j]][l[i]][w[i]+w[j]] = max(dp[l[j]][l[i]][w[i]+w[j]], (ll)l[i] + l[j]);
      }
    }
  }
  for(int k = 0; k <= 50; k++){
    for(int i = 1; i <= 50; i++){
      for(int j = 1; j <= 50; j++){
        if(t[i] == 0 || t[j] == 0 || t[j] > k || i == j)continue;
        ok[i][j][k] = true;
        if(i > j){
          for(int l = 1; l < i; l++){
            if(l == j)continue;
            dp[i][j][k] = max(dp[i][j][k], dp[l][i][k-t[j]] + j);
          }
        }else{
          for(int l = i + 1; l <= 50; l++){
            if(l == j)continue;
            dp[i][j][k] = max(dp[i][j][k], dp[l][i][k-t[j]] + j);
          }
        }
      }
    }
  }
  ll res = 0;
  for(int i = 1; i <= 50; i++){
    for(int j = 1; j <= 50; j++){
      for(int k = 0; k <= c; k++){
        if(ok[i][j][k])res = max(res, dp[i][j][k]);
      }
    }
  }
  cout << res << endl;
	return 0;
}