#include <bits/stdc++.h>

using namespace std;
using ll = long long;

int main(){
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);

    ll N, M, sm=0, ans=1e18;
    cin >> N >> M;
    vector<ll> A(N), B(M), C(N), S(N);
    for (int i=0; i<N; i++) cin >> A[i];
    for (int i=0; i<M; i++) cin >> B[i];
    for (int i=0; i<N; i++) cin >> C[i];

    for (int i=0; i<N-1; i++){
        S[i+1] = S[i] + B[i % M];
    }

    map<ll, ll> mp;
    for (int i=0; i<N; i++){
        mp[A[i]-S[i]] += C[i];
        sm += C[i];
    }

    for (auto [x, y] : mp){
        ans = min(ans, sm-y);
    }

    cout << ans << endl;

    return 0;
}