#include <bits/stdc++.h>
using namespace std;
const int seed = 131;
const long long LLMAX = 2e18;
const int MOD = 1e9 + 7;
const double eps = 1e-8;
const int MAXN = 5e3 + 10;
const int hmod1 = 0x48E2DCE7;
const int hmod2 = 0x60000005;
inline long long sqr(long long x) { return x * x; }
inline int sqr(int x) { return x * x; }
inline double sqr(double x) { return x * x; }
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
long long exgcd(long long a, long long b, long long &x, long long &y) {
  long long d;
  (b == 0 ? (x = 1, y = 0, d = a)
          : (d = exgcd(b, a % b, y, x), y -= a / b * x));
  return d;
}
long long qpow(long long a, long long n) {
  long long sum = 1;
  while (n) {
    if (n & 1) sum = sum * a % MOD;
    a = a * a % MOD;
    n >>= 1;
  }
  return sum;
}
inline int dcmp(double x) {
  if (fabs(x) < eps) return 0;
  return (x > 0 ? 1 : -1);
}
int dp[MAXN][MAXN];
int l[MAXN], s[MAXN], c[MAXN];
int main(void) {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n, m, ans = 0;
  cin >> n >> m;
  for (int i = 1; i <= n; i++) cin >> l[i];
  for (int i = 1; i <= n; i++) cin >> s[i];
  for (int i = 1; i <= n + m; i++) cin >> c[i];
  memset(dp, -0x3f3f3f3f, sizeof(dp));
  for (int i = 0; i <= n + m; i++) dp[i][0] = 0;
  for (int i = n; i >= 1; i--) {
    for (int j = n; j >= 1; j--)
      dp[l[i]][j] = max(dp[l[i]][j], dp[l[i]][j - 1] - s[i] + c[l[i]]);
    for (int j = n; j >= 1; j--) {
      for (int k = l[i] + 1, bit = j; k <= n + m; k++, bit /= 2) {
        dp[k][bit / 2] = max(dp[k][bit / 2], dp[k - 1][bit] + bit / 2 * c[k]);
        if (bit == 0) break;
      }
    }
    for (int j = 1; j <= n + m; j++) dp[j][0] = max(dp[j][0], dp[j - 1][0]);
  }
  for (int i = 0; i <= n + m; i++) ans = max(ans, dp[i][0]);
  cout << ans << endl;
  return 0;
}
