#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
long long dp1[601][601];
long long dp2[601][601];
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, k; cin >> n >> k;
	int n2 = n * 2;
	vector<int>a(n2);
	long long ans = 0;
	rep(i, n) {
		cin >> a[i], a[i + n] = a[i];
		chmax(ans, a[i]);
	}
	vector<long long>sa(n2 + 1);
	rep(i, n2)sa[i + 1] = sa[i] + a[i];
	auto range = [&](long long b) {
		long long res = b;
		for (int i = 1; i <= k; i++) {
			res |= b << i;
			res |= b >> i;
		}
		return res;
	};
	rep(i, n) {
		int c; cin >> c;
		long long bit = 1LL << c;
		dp1[i][i + 1] = dp1[i + n][i + n + 1] = bit;
		dp2[i][i + 1] = dp2[i + n][i + n + 1] = range(bit);
	}
	rep2(i, 2, n + 1) {// 幅
		rep(l, 2 * n) {
			int r = l + i;
			if (r > 2 * n)continue;
			long long val = 0;
			rep2(c, l + 1, r) {
				val |= dp1[l][c] & dp2[c][r];
				val |= dp2[l][c] & dp1[c][r];
			}
			if (val) {
				chmax(ans, sa[r] - sa[l]);
				dp1[l][r] = val;
				dp2[l][r] = range(val);
			}
		}
	}
	cout << ans << endl;
	return 0;
}