func_code_string: #include <bits/stdc++.h>   using namespace std;   using ll = long long;   template <class t, class u>   void chmax(t& first, u second) {     if (first < second) first = second;   }   template <class t, class u>   void chmin(t& first, u second) {     if (second < first) first = second;   }   template <class t>   using vc = vector<t>;   template <class t>   using vvc = vc<vc<t>>;   using pi = pair<ll, ll>;   using vi = vc<ll>;   template <class t, class u>   ostream& operator<<(ostream& os, const pair<t, u>& p) {     return os <<  {  << p.first <<  ,  << p.second <<  } ;   }   template <class t>   ostream& operator<<(ostream& os, const vc<t>& v) {     os <<  { ;     for (auto e : v) os << e <<  , ;     return os <<  } ;   }   using uint = unsigned;   using ull = unsigned long long;   template <class t, size_t n>   ostream& operator<<(ostream& os, const array<t, n>& first) {     return os << vc<t>(first.begin(), first.end());   }   template <ll i, class T>   void print_tuple(ostream&, const T&) {}   template <ll i, class T, class H, class... Args>   void print_tuple(ostream& os, const T& t) {     if (i) os <<  , ;     os << get<i>(t);     print_tuple<i + 1, T, Args...>(os, t);   }   template <class... Args>   ostream& operator<<(ostream& os, const tuple<Args...>& t) {     os <<  { ;     print_tuple<0, tuple<Args...>, Args...>(os, t);     return os <<  } ;   }   template <class t>   void print(t x, ll suc = 1) {     cout << x;     if (suc == 1) cout <<   n ;     if (suc == 2) cout <<    ;   }   ll read() {     ll i;     cin >> i;     return i;   }   vi readvi(ll n, ll off = 0) {     vi v(n);     for (ll i = ll(0); i < ll(n); i++) v[i] = read() + off;     return v;   }   template <class T>   void print(const vector<T>& v, ll suc = 1) {     for (ll i = ll(0); i < ll(v.size()); i++)       print(v[i], i == ll(v.size()) - 1 ? suc : 2);   }   string readString() {     string s;     cin >> s;     return s;   }   template <class T>   T sq(const T& t) {     return t * t;   }   void yes(bool ex = true) {     cout <<  Yes           <<   n ;     if (ex) exit(0);   }   void no(bool ex = true) {     cout <<  No           <<   n ;     if (ex) exit(0);   }   void possible(bool ex = true) {     cout <<  Possible           <<   n ;     if (ex) exit(0);   }   void impossible(bool ex = true) {     cout <<  Impossible           <<   n ;     if (ex) exit(0);   }   constexpr ll ten(ll n) { return n == 0 ? 1 : ten(n - 1) * 10; }   const ll infLL = LLONG_MAX / 3;   const ll inf = infLL;   ll topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }   ll topbit(ll t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }   ll botbit(signed first) { return first == 0 ? 32 : __builtin_ctz(first); }   ll botbit(ll first) { return first == 0 ? 64 : __builtin_ctzll(first); }   ll popcount(signed t) { return __builtin_popcount(t); }   ll popcount(ll t) { return __builtin_popcountll(t); }   bool ispow2(ll i) { return i && (i & -i) == i; }   ll mask(ll i) { return (ll(1) << i) - 1; }   bool inc(ll first, ll second, ll c) { return first <= second && second <= c; }   template <class t>   void mkuni(vc<t>& v) {     sort(v.begin(), v.end());     v.erase(unique(v.begin(), v.end()), v.end());   }   ll rand_int(ll l, ll r) {     static mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());     return uniform_int_distribution<ll>(l, r)(gen);   }   template <class t>   void myshuffle(vc<t>& first) {     for (ll i = ll(0); i < ll(ll(first.size())); i++)       swap(first[i], first[rand_int(0, i)]);   }   template <class t>   ll lwb(const vc<t>& v, const t& first) {     return lower_bound(v.begin(), v.end(), first) - v.begin();   }   signed main() {     cin.tie(0);     ios::sync_with_stdio(0);     cout << fixed << setprecision(20);     ll n, m;     cin >> n >> m;     vi lv = readvi(n, -1);     vi cost = readvi(n);     vi c = readvi(n + m);     void(0);     vvc<ll> dp(m);     for (ll i = ll(0); i < ll(n); i++) dp[lv[i]].push_back(-inf);     {       ll pre = 0;       for (ll i = ll(0); i < ll(m); i++) {         pre >>= 1;         pre += ll(dp[i].size());         if (ll(dp[i].size())) dp[i].resize(pre, -inf);       }     }     ll ans = 0;     for (ll i = ll(n) - 1; i >= ll(0); i--) {       for (ll j = ll(ll(dp[lv[i]].size()) - 1) - 1; j >= ll(0); j--)         chmax(dp[lv[i]][j + 1], dp[lv[i]][j] - cost[i]);       chmax(dp[lv[i]][0], -cost[i]);       for (ll j = ll(0); j < ll(lv[i]); j++) {         ll ad = 0;         for (ll k = ll(0); k < ll(ll(dp[j].size())); k++) {           ll u = popcount(k ^ (k + 1));           for (ll l = ll(0); l < ll(min(u, lv[i] - j)); l++) ad += c[j + l];           void(0);           void(0);           chmax(dp[lv[i]][(k + 1) >> min(ll(60), lv[i] - j)],                 dp[j][k] + ad - cost[i]);         }       }     }     void(0);     for (ll i = ll(0); i < ll(m); i++)       for (ll j = ll(0); j < ll(ll(dp[i].size())); j++) {         ll cur = i, cnt = j + 1;         ll val = dp[i][j];         void(0);         while (cnt) {           val += c[cur] * cnt;           cur++;           cnt >>= 1;         }         if (val == 7) {           void(0);           void(0);         }         chmax(ans, val);       }     print(ans);   }   