#include <bits/stdc++.h>
using namespace std;
const int N = 2005;
int l[N], s[N], c[N << 1], f[N << 1][N], n, m, size[N];
int main() {
  scanf("%d%d", &n, &m);
  for (int i = n; i >= 1; i--) scanf("%d", l + i);
  for (int i = n; i >= 1; i--) scanf("%d", s + i);
  for (int i = 1; i <= n + m; i++) scanf("%d", c + i);
  for (int i = 1; i <= n + m; i++)
    for (int j = 1; j <= n; j++) f[i][j] = -1e9;
  for (int i = 1; i <= n; 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] + 1, t = n; j <= n + m; j++, t >>= 1)
      for (int k = 0; k <= t; k++)
        f[j][k >> 1] = max(f[j][k >> 1], f[j - 1][k] + (k >> 1) * c[j]);
  }
  cout << f[n + m][0] << endl;
}
