#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <utility>
#include <string>
#include <queue>
#include <stack>
#include <deque>
#include <unordered_set>
#include <unordered_map>

using namespace std;

typedef long long int ll;
typedef pair<int, int> Pii;

const ll mod = 998244353;

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);

  int n, m;
  cin >> n >> m;
  vector<ll> a(n), b(m), c(n);
  for (auto &x: a) cin >> x;
  for (auto &x: b) cin >> x;
  for (auto &x: c) cin >> x;

  vector<ll> diff(n);
  diff[0] = 0;
  for (int i = 1; i < n; i++) {
    diff[i] = diff[i - 1] + ((a[i] - a[i - 1]) - b[(i - 1) % m]);
  }

  unordered_map<ll, vector<int>> diff_group;
  for (int i = 0; i < n; i++) {
    diff_group[diff[i]].push_back(i);
  }

  ll cost_max = 0;
  for (int i = 0; i < n; i++) {
    cost_max += c[i];
  }

  ll ans = (ll) 9e18;
  for (auto &[k, v]: diff_group) {
    ll cost = cost_max;
    for (auto &i: v) {
      cost -= c[i];
    }
    ans = min(ans, cost);
  }

  cout << ans << endl;

  return 0;
}