#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

ll dp1[601][601];
ll dp2[601][601];

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  ll ans = 0;
  int n, k;
  cin >> n >> k;
  int n2 = 2 * n;
  VI a(n2);
  rep(i, n) cin >> a[i], a[i+n] = a[i], chmax<ll>(ans, a[i]);
  VL s(n2 + 1);
  rep(i, n2) s[i+1] = s[i] + a[i];
  auto blur = [&](ll b) {
    ll res = b;
    for(int i = 1; i <= k; i++) {
      res |= b << i;
      res |= b >> i;
    }
    return res;
  };
  rep(i, n) {
    int c;
    cin >> c;
    ll bit = 1LL << c;
    dp1[i][i+1] = dp1[i+n][i+n+1] = bit;
    dp2[i][i+1] = dp2[i+n][i+n+1] = blur(bit);
  }
  rep(r, n2 + 1) rrep(l, r - 1) {
    if (r - l > n) break;
    if (l >= n) {
      dp1[l][r] = dp1[l-n][r-n];
      dp2[l][r] = dp2[l-n][r-n];
      continue;
    }
    ll v = 0;
    for(int c = l + 1; c < r; c++) {
      v |= dp1[l][c] & dp2[c][r];
      v |= dp2[l][c] & dp1[c][r];
    }
    if (v) {
      chmax(ans, s[r] - s[l]);
      dp1[l][r] = v;
      dp2[l][r] = blur(v);
    }
  }
  cout << ans << '\n';
}