#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f;
int s[2005], l[2005];
int c[4005];
long long dp[4005][2005];
void work() {
  int n, m;
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &l[n - i + 1]);
  }
  for (int i = 1; i <= n; i++) {
    scanf("%d", &s[n - i + 1]);
  }
  memset(dp, -inf, sizeof(dp));
  for (int i = 1; i <= n + m; i++) {
    scanf("%d", &c[i]);
    dp[i][0] = 0;
  }
  dp[0][0] = 0;
  for (int i = 1; i <= n; i++) {
    for (int j = n; j >= 1; j--) {
      dp[l[i]][j] = max(dp[l[i]][j], dp[l[i]][j - 1] + c[l[i]] - s[i]);
    }
    for (int j = l[i] + 1, k = n; j <= n + m; j++, k >>= 1) {
      for (int p = 0; p <= k; p++) {
        dp[j][p / 2] = max(dp[j][p / 2], dp[j - 1][p] + p / 2 * c[j]);
      }
    }
  }
  printf("%lld\n", dp[n + m][0]);
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int T = 1;
  while (T--) {
    work();
  }
}
