#include <bits/stdc++.h>
using namespace std;
int main(){
  int N, K;
  cin >> N >> K;
  vector<int> A(N);
  for (int i = 0; i < N; i++){
    cin >> A[i];
  }
  vector<int> C(N);
  for (int i = 0; i < N; i++){
    cin >> C[i];
  }
  vector<long long> S(N + 1);
  S[0] = 0;
  for (int i = 0; i < N; i++){
    S[i + 1] = S[i] + A[i];
  }
  auto sum = [&](int L, int R){
    if (L < R){
      return S[R] - S[L];
    } else {
      return (S[N] - S[L]) + S[R];
    }
  };
  auto match = [&](long long a, long long b){
    long long ans = a & b;
    for (int i = 1; i <= K; i++){
      ans |= a & (b << i);
      ans |= a & (b >> i);
      ans |= (a << i) & b;
      ans |= (a >> i) & b;
    }
    return ans;
  };
  vector<vector<long long>> dp(N, vector<long long>(N, 0));
  for (int i = 0; i < N - 1; i++){
    dp[i][i + 1] = (long long) 1 << C[i];
  }
  dp[N - 1][0] = (long long) 1 << C[N - 1];
  for (int i = 2; i <= N; i++){
    for (int j = 0; j < N; j++){
      for (int k = j + 1; k < j + i; k++){
        dp[j][(j + i) % N] |= match(dp[j][k % N], dp[k % N][(j + i) % N]);
      }
    }
  }
  long long ans = 0;
  for (int i = 0; i < N; i++){
    for (int j = 0; j < N; j++){
      if (dp[i][j] != 0){
        ans = max(ans, sum(i, j));
      }
    }
  }
  cout << ans << endl;
}