#include <bits/stdc++.h>
const int maxn = 2005, maxm = 4005;
int n, m;
int l[maxn], s[maxn], c[maxm], f[maxm][maxn];
inline int max(int a, int b) { return a > b ? a : b; }
int main() {
  scanf("%d%d", &n, &m), m += n;
  for (int i = 1; i <= n; i++) scanf("%d", &l[i]);
  for (int i = 1; i <= n; i++) scanf("%d", &s[i]);
  for (int i = 1; i <= m; i++) scanf("%d", &c[i]);
  memset(f, 128, sizeof(f));
  for (int i = 0; i <= m; i++) f[i][0] = 0;
  for (int i = n; i >= 1; i--) {
    for (int j = n; j >= 1; j--)
      f[l[i]][j] = max(f[l[i]][j], f[l[i]][j - 1] + c[l[i]] - s[i]);
    for (int j = l[i]; j <= m; j++)
      for (int k = 0; k <= n >> (j - l[i]); k++)
        f[j + 1][k / 2] = max(f[j + 1][k / 2], f[j][k] + (k / 2) * c[j + 1]);
  }
  printf("%d\n", f[m][0]);
  return 0;
}
