#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;

using int64 = long long;
constexpr int mod = 998244353;
constexpr int64 infll = (1LL << 62) - 1;
constexpr int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;

template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
  os << p.first << " " << p.second;
  return os;
}

template<typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
  is >> p.first >> p.second;
  return is;
}

template<typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  for (int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template<typename T>
istream &operator>>(istream &is, vector<T> &v) {
  for (T &in : v) is >> in;
  return is;
}

template<typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

template<typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

template<typename T = int64>
vector<T> make_v(size_t a) {
  return vector<T>(a);
}

template<typename T, typename... Ts>
auto make_v(size_t a, Ts... ts) {
  return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}

template<typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
  t = v;
}

template<typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
  for (auto &e : t) fill_v(e, v);
}

template<typename F>
struct FixPoint : F {
  explicit FixPoint(F &&f) : F(forward<F>(f)) {}

  template<typename... Args>
  decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, forward<Args>(args)...);
  }
};

template<typename F>
inline decltype(auto) MFP(F &&f) {
  return FixPoint<F>{forward<F>(f)};
}

int main() {
  int N, M;
  cin >> N >> M;
  vector< int64 > A(N), B(M), C(N);
  cin >> A >> B >> C;
  int64 ret = infll;
  {
    auto D = A;
    int64 sub = 0;
    for (int i = 0; i + 1 < N; i++) {
      // D[i + 1] - D[i] == B[i % M]
      if(D[i + 1] - D[i] != B[i % M]) {
        D[i + 1] = B[i % M] + D[i];
        sub += C[i + 1];
      }
    }
    chmin(ret, sub);
  }
  {
    auto D = A;
    int64 sub = 0;
    for (int i = N - 2; i >= 0; i--) {
      // D[i + 1] - D[i] == B[i % M]
      if(D[i + 1] - D[i] != B[i % M]) {
        D[i] = D[i + 1] - B[i % M];
        sub += C[i];
      }
    }
    chmin(ret, sub);
  }
  cout << ret << endl;
}