#include <bits/stdc++.h>
using namespace std;
int dp[7010][2010];
int n, m;
int l[2010];
int hire[2010];
int prof[7010];
int main() {
  ios::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  cin >> n >> m;
  for (int i = n; i >= 1; i--) cin >> l[i];
  for (int i = n; i >= 1; i--) cin >> hire[i];
  for (int i = 1; i <= n + m; i++) cin >> prof[i];
  memset(dp, 0xc0, sizeof(dp));
  for (int i = 1; i <= n + m; i++) {
    dp[i][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] - hire[i] + prof[l[i]]);
    for (int j = l[i], mx = n; j <= n + m; j++, mx >>= 1)
      for (int k = 0; k <= mx; k++)
        dp[j + 1][k / 2] =
            max(dp[j + 1][k / 2], dp[j][k] + k / 2 * prof[j + 1]);
  }
  cout << dp[n + m][0] << endl;
  return 0;
}
