# include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template<class T>constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template<class T>constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char>T_char TL(T_char cX) { return tolower(cX); };
template <typename T_char>T_char TU(T_char cX) { return toupper(cX); };
typedef pair<LL, LL> pii;
const int vy[] = { -1, -1, -1, 0, 1, 1, 1, 0 }, vx[] = { -1, 0, 1, 1, 1, 0, -1, -1 };
const int dx[4] = { 0,1,0,-1 }, dy[4] = { 1,0,-1,0 };
int popcnt(unsigned long long n) { int cnt = 0; for (int i = 0; i < 64; i++)if ((n >> i) & 1)cnt++; return cnt; }
int d_sum(LL n) { int ret = 0; while (n > 0) { ret += n % 10; n /= 10; }return ret; }
int d_cnt(LL n) { int ret = 0; while (n > 0) { ret++; n /= 10; }return ret; }
LL gcd(LL a, LL b) { if (b == 0)return a; return gcd(b, a%b); };
LL lcm(LL a, LL b) { LL g = gcd(a, b); return a / g*b; };
# define ALL(qpqpq)           (qpqpq).begin(),(qpqpq).end()
# define UNIQUE(wpwpw)        sort(ALL((wpwpw)));(wpwpw).erase(unique(ALL((wpwpw))),(wpwpw).end())
# define LOWER(epepe)         transform(ALL((epepe)),(epepe).begin(),TL<char>)
# define UPPER(rprpr)         transform(ALL((rprpr)),(rprpr).begin(),TU<char>)
# define FOR(i,tptpt,ypypy)   for(LL i=(tptpt);i<(ypypy);i++)
# define REP(i,upupu)         FOR(i,0,upupu)
# define INIT                 std::ios::sync_with_stdio(false);std::cin.tie(0)

int n, c;
int l[55], w[55];
int dp[55][55][55];

bool iskado(int a, int b, int c){
    if(a == 0 || b == 0 || c == 0)return false;
    if(a == b || a == c || b == c)return false;
    return ((max({a, b, c}) == b) || (min({a, b, c}) == b));
}

int main(){
    INIT;
    cin >> n >> c;
    for(int i = 1;i <= n;i++)cin >> l[i];
    for(int i = 1;i <= n;i++)cin >> w[i];
    REP(i, 55)REP(j, 55)REP(k, 55)dp[i][j][k] = -HINF<int>();
    dp[0][0][0] = 0;
    for(int i = 0;i <= c;i++){
        for(int j = 0;j <= 50;j++){
            for(int k = 0;k <= 50;k++){
                for(int idx = 1;idx <= n;idx++){
                    if(i - w[idx] < 0)continue;
                    dp[i][0][l[idx]] = max(dp[i][0][l[idx]], dp[i - w[idx]][0][0] + l[idx]);
                    if(k != l[idx])dp[i][k][l[idx]] = max(dp[i][k][l[idx]], dp[i - w[idx]][0][k] + l[idx]);
                    if(iskado(j, k, l[idx]))dp[i][k][l[idx]] = max(dp[i][k][l[idx]], dp[i - w[idx]][j][k] + l[idx]);
                }
            }
        }
    }
    int ans = 0;
    REP(i, 55)REP(j, 55)REP(k, 55){
        if(dp[i][j][k] - j - k <= 0)continue;
        ans = max(ans, dp[i][j][k]);
    }
    cout << ans << endl;
}