#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i)
#define rep(i, n) drep(i, 0, n - 1)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second

mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
const ll MOD1000000007 = 1000000007;
const ll MOD998244353 = 998244353;
const ll MOD[3] = {999727999, 1070777777, 1000000007};
const ll LINF = 1LL << 60;
const int IINF = (1 << 30) - 1;

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    
    int N, K; cin >> N >> K;
    vector<ll> A(N);
    vector<int> C(N);
    for(int i=0; i<N; i++) cin >> A[i];
    for(int i=0; i<N; i++){
        cin >> C[i];
        C[i]--;
    }

    vector<vector<vector<ll>>> dp(N, vector<vector<ll>>(N, vector<ll>(50, -1)));
    vector<vector<vector<ll>>> ldp(N, vector<vector<ll>>(N, vector<ll>(50, -1)));
    vector<vector<vector<ll>>> rdp(N, vector<vector<ll>>(N, vector<ll>(50, -1)));
    //初期化
    for(int i=0; i<N; i++){
        dp[i][i][C[i]] = A[i];

        for(int c=0; c<50; c++){
            for(int j=0; j<=K; j++){
                if(c-j>=0) ldp[i][i][c]=max(ldp[i][i][c], dp[i][i][c-j]);
            }
        }
        //rdpの更新
        for(int c=0; c<50; c++){
            for(int j=0; j<=K; j++){
                if(c+j<50) rdp[i][i][c]=max(rdp[i][i][c], dp[i][i][c+j]);
            }
        }
    }

    //遷移
    for(int d=2; d<=N; d++){
        for(int l=0; l<N; l++){
            //[l, (l+d-1)%N]の解を求める
            ll r = (l+d-1)%N;
            for(int m=l; m<l+d-1; m++){
                int mmod = m%N;
                //[l, mmod]と[mmod+1, (l+d-1)%N]をマージ
                for(int c=0; c<50; c++){
                    if(dp[l][mmod][c]!=-1 && max(ldp[(mmod+1)%N][r][c], rdp[(mmod+1)%N][r][c])!=-1){
                        dp[l][r][c] = dp[l][mmod][c]+max(ldp[(mmod+1)%N][r][c], rdp[(mmod+1)%N][r][c]);
                    }
                    if(dp[(mmod+1)%N][r][c]!=-1 && max(ldp[l][mmod][c], rdp[l][mmod][c])!=-1){
                        dp[l][r][c] = dp[(mmod+1)%N][r][c]+max(ldp[l][mmod][c], rdp[l][mmod][c]);
                    }
                }
            }

            //ldpの更新
            for(int c=0; c<50; c++){
                for(int i=0; i<=K; i++){
                    if(c-i>=0) ldp[l][r][c]=max(ldp[l][r][c], dp[l][r][c-i]);
                }
            }
            //rdpの更新
            for(int c=0; c<50; c++){
                for(int i=0; i<=K; i++){
                    if(c+i<50) rdp[l][r][c]=max(rdp[l][r][c], dp[l][r][c+i]);
                }
            }
        }
    }

    ll ans = -LINF;
    for(int l=0; l<N; l++) for(int r=0; r<N; r++) for(int c=0; c<50; c++){
        ans = max(ans, dp[l][r][c]);
    }

    cout << ans << endl;
}