#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
const ll ILL=2167167167167167167;
const int INF=2100000000;
const int mod=998244353;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}
template<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){assert(!a.empty());T ans=a[0]-a[0];for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}



void solve();
// oddloop
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t=1;
	//cin>>t;
	rep(i,0,t) solve();
}

void solve(){
	int N,K;
	cin>>N>>K;
	vector<ll> A(N);
	vector<int> C(N);
	rep(i,0,N) cin>>A[i];
	rep(i,0,N) cin>>C[i];
	rep(i,0,N) A.push_back(A[i]),C.push_back(C[i]);
	vector X(N*2+1,vector<ll>(N*2+1));
	vector Y(N*2+1,vector<ll>(N*2+1));
	rep(i,0,N*2){
		X[i][i+1]=(1ll<<(C[i]+K));
		Y[i][i+1]=((1ll<<(2*K+1))-1)<<C[i];
	}
	//cout<<X[0][1]<<" "<<Y[1][2]<<endl;
	//cout<<(X[0][1]&Y[1][2])<<endl;
	ll ans=vec_max(A);
	rep(ran,2,N+1){
		for(int l=0,r=ran;r<=2*N;r++,l++){
			rep(j,l+1,r){
				X[l][r]=(X[l][r]|(X[l][j]&Y[j][r])|(Y[l][j]&X[j][r]));
			}
			Y[l][r]=X[l][r];
			rep(i,1,K+1) Y[l][r]=(Y[l][r]|(X[l][r]<<i)),Y[l][r]=(Y[l][r]|(X[l][r]>>i));
			if(X[l][r]){
				ll tmp=0;
				rep(i,l,r) tmp+=A[i];
				chmax(ans,tmp);
			}
		}
	}
	cout<<ans<<"\n";

}