#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={0,-1,0,1,1,1,-1,-1,0};
const ll dx[9]={-1,0,1,0,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
ll dp[52][52][51];
int main(){
    ll n,c;cin >> n >> c;
    rep(i,52)rep(j,52)rep(k,51)dp[i][j][k]=-INF;
    dp[0][51][0]=0;dp[51][0][0]=0;
    ll ans=0;
    vl L(n),W(n);
    rep(i,n)cin >> L[i];
    rep(i,n)cin >> W[i];
    rep(i,50){
        ll ndp[52][52][51];
        rep(j,52)rep(k,52)rep(l,51)ndp[j][k][l]=-INF;
        rep(j,52){
            rep(k,52){
                rep(l,51){
                    rep(f,n){
                        if(W[f]+l>50)continue;
                        if(L[f]==j||L[f]==k)continue;
                        if((j<k&&k<L[f])||(j>k&&k>L[f]))continue;
                        chmax(ndp[k][L[f]][l+W[f]],dp[j][k][l]+L[f]);
                    }
                }
            }
        }
        swap(dp,ndp);
        if(i>=2){
            rep(j,52)rep(k,52)rep(l,c+1)chmax(ans,dp[j][k][l]);
        }
    }
    cout << ans << endl;
}