#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, m; cin >> n >> m;
	vector<long long>a(n), b(m), c(n);
	rep(i, n)cin >> a[i];
	rep(i, m)cin >> b[i];
	rep(i, n)cin >> c[i];
	vector<long long>sum(n);
	rep(i, n - 1)sum[i + 1] = sum[i] + b[i%m];
	long long cs = 0;
	rep(i, n)cs += c[i];
	map<long long, long long>mp;
	rep(i, n) mp[a[i] - sum[i]] += c[i];
	long long ans = cs;
	for (auto[k, v] : mp) chmin(ans, cs - v);
	cout << ans << endl;
	return 0;
}