/* -*- coding: utf-8 -*-
 *
 * 2566.cc:  No.2566 美しい整数列 - yukicoder
 */

#include<cstdio>
#include<map>
#include<algorithm>
 
using namespace std;

/* constant */

const int MAX_N = 200000;

/* typedef */

typedef long long ll;
typedef map<ll,ll> mll;

/* global variables */

int as[MAX_N], bs[MAX_N], cs[MAX_N];
ll bss[MAX_N];

/* subroutines */

/* main */

int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  for (int i = 0; i < n; i++) scanf("%d", as + i);
  for (int i = 0; i < m; i++) scanf("%d", bs + i);
  for (int i = 0; i < n; i++) scanf("%d", cs + i);

  bss[0] = 0;
  for (int i = 0; i + 1 < n; i++) bss[i + 1] = bss[i] + bs[i % m];

  ll csum = 0;
  mll dcs;
  for (int i = 0; i < n; i++) {
    csum += cs[i];
    dcs[bss[i] - as[i]] += cs[i];
  }

  ll maxc = 0;
  for (auto &dc: dcs) maxc = max(maxc, dc.second);

  printf("%lld\n", csum - maxc);

  return 0;
}