#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <set>
#include <map>
#include <string>
#include <queue>
using namespace std;
#define int long long
signed main() {
  int n, m; cin >> n >> m;
  vector<int> a(n); for (int i = 0; i < n; i++) cin >> a[i];
  vector<int> b(m); for (int i = 0; i < m; i++) cin >> b[i];
  vector<int> c(n); for (int i = 0; i < n; i++) cin >> c[i];
  map<int, int> mp;
  int s = b[0];
  mp[a[0]] -= c[0];
  for (int i = 1; i < n; i++) {
    // s + base == a[i]
    // base = a[i] - s;
    int base = a[i] - s;
    mp[base] -= c[i];
    s += b[i % m];
  }
  int ans = 1ll<<60;
  for (auto [k, v] : mp) {
    ans = min(ans, v);
  }
  for (int i = 0; i < n; i++) {
    ans += c[i];
  }
  cout << ans << endl;

}