#include <bits/stdc++.h>
using namespace std;
const int N = 5000 + 10, inf = 1e9;
int a[N], b[N], c[N], f[N][N], g[N];
int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  for (int i = 1; i <= n; i++) scanf("%d", &b[i]);
  for (int i = 1; i <= n + m; i++) scanf("%d", &c[i]);
  for (int i = 1; i <= m; i++)
    for (int j = 1; j <= n + m; j++) f[i][j] = -inf;
  for (int i = 1; i <= n + m; i++) g[i] = 0;
  for (int i = n; i >= 1; i--) {
    for (int j = n + m; j >= 2; j--) {
      f[a[i]][j] = max(f[a[i]][j], f[a[i]][j - 1] - b[i]);
      if (f[a[i]][j] == -inf) continue;
      int x = f[a[i]][j], y = j;
      for (int k = a[i] + 1;; k++) {
        x += c[k - 1] * y, y >>= 1;
        f[k][y] = max(f[k][y], x);
        if (y == 0) {
          g[k] = max(g[k], x);
          break;
        }
      }
    }
    for (int j = 1; j <= a[i]; j++) f[a[i]][1] = max(f[a[i]][1], g[j] - b[i]);
    g[a[i] + 1] = max(g[a[i] + 1], f[a[i]][1] + c[a[i]]);
  }
  int ans = 0;
  for (int i = 1; i <= n + m; i++) ans = max(ans, g[i]);
  cout << ans << endl;
}
