#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
  #include "settings/debug.cpp"
  #define _GLIBCXX_DEBUG
#else
  #define Debug(...) void(0)
#endif
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); ++i)

int main() {
  int n, m;
  cin >> n >> m;
  vector<int> 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<ll> ideal_a(1, 0);
  rep(i, n - 1) ideal_a.push_back(ideal_a.back() + b[i % m]);
  Debug(ideal_a);
  // greedy
  unordered_set<ll> cand;
  rep(i, n) cand.insert(a[i] - ideal_a[i]);
  ll ans = 1e18;
  for (ll a0 : cand) {
    ll sum = 0;
    rep(i, n) {
      if (a0 + ideal_a[i] != a[i]) sum += c[i];
    }
    ans = min(ans, sum);
  }
  cout << ans << endl;
  return 0;
}