#include <bits/stdc++.h>
using namespace std;

int main() {
    // 入力 (数珠なので、2 週させる)
    int N, K;
    cin >> N >> K;
    vector<long long> A(N*2), C(N*2);
    for (int i = 0; i < N; ++i) { cin >> A[i]; A[i+N] = A[i]; }
    for (int i = 0; i < N; ++i) { cin >> C[i]; C[i+N] = C[i]; }
    
    // 累積和
    vector<long long> S(N*2+1, 0);
    for (int i = 0; i < N*2; ++i) S[i+1] = S[i] + A[i];
    
    // dp
    vector dp(N*2, vector(N*2+1, bitset<52>(false)));
    for (int l = 0; l < N*2; ++l) dp[l][l+1][C[l]] = true;
    for (int between = 2; between <= N; ++between) {
        for (int l = 0; l + between <= N*2; ++l) {
            int r = l + between;
            for (int m = l+1; m < r; ++m) {
                for (int k = 0; k <= K; ++k) {
                    dp[l][r] |= dp[l][m] & (dp[m][r] << k);
                    dp[l][r] |= dp[l][m] & (dp[m][r] >> k);
                    dp[l][r] |= (dp[l][m] << k) & dp[m][r];
                    dp[l][r] |= (dp[l][m] >> k) & dp[m][r];
                }
            }
        }
    }
    
    // 集計
    long long res = 0;
    for (int l = 0; l <= N; ++l) {
        for (int r = l+1; r <= N*2; ++r) {
            for (int c = 0; c <= 50; ++c) {
                if (dp[l][r][c]) res = max(res, S[r] - S[l]);
            }
        }
    }
    cout << res << endl;
}