#include <cstdio>
#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <bitset>
#include <iomanip>
#include <limits>
#include <chrono>
#include <random>
#include <array>
#include <unordered_map>
#include <functional>
#include <complex>

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

const long long MAX = 5100000;
const long long INF = 1LL << 60;
const long long mod = 1000000007LL;
//const long long mod = 998244353LL;

using namespace std;
typedef unsigned long long ull;
typedef long long ll;

int main()
{
	/*
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	*/

	ll n, c; scanf("%lld %lld", &n, &c);
	vector<ll> l(n), w(n);
	for (ll i = 0; i < n; i++) scanf("%lld", &l[i]);
	for (ll i = 0; i < n; i++) scanf("%lld", &w[i]);
	vector<vector<vector<ll>>> dp(c + 1, vector<vector<ll>>(n, vector<ll>(n, -1)));
	for (ll i = 0; i < n; i++) {
		for (ll j = 0; j < n; j++) {
			for (ll k = 0; k < n; k++) {
				if (l[i] != l[j] && l[j] != l[k] && l[k] != l[i] && ((l[i] < l[j] && l[j] > l[k]) || (l[i] > l[j] && l[j] < l[k]))) {
					ll cost = w[i] + w[j] + w[k];
					if (cost > c) continue;
					chmax(dp[cost][j][k], l[i]+l[j]+l[k]);
				}
			}
		}
	}
	ll res = 0;
	for (ll i = 0;i <= c;i++){
		for (ll j = 0; j < n; j++) {
			for (ll k = 0; k < n; k++) {
				chmax(res, dp[i][j][k]);
				if (dp[i][j][k] == -1) continue;
				for (ll m = 0; m < n; m++) {
					if (i + w[m] <= c) {
						if (l[j] != l[m] && l[k] != l[m] && ((l[j] < l[k] && l[k] > l[m]) || (l[j] > l[k] && l[k] < l[m]))) {
							chmax(dp[i + w[m]][k][m], dp[i][j][k] + l[m]);
							//cout << i<<" "<<j << " " << k << " " << m << " " << dp[i + w[m]][k][m] << endl;
						}
					}
				}
			}
		}
	}
	cout << res << endl;
	
	return 0;
}