#include <iostream>
#include <queue>
#include <vector>
using namespace std;

using ll = long long;
int main() {
  int n, a, b;
  cin >> n >> a >> b;
  int x = min(a, b);
  a -= x / n * n;
  b -= x / n * n;
  ll ans = (ll)(x / n) * (2e9 + 2);
  vector<ll> pos(n);
  for (int i = 0; i < n; i++)
    cin >> pos[i];
  priority_queue<pair<ll, bool>> pq; // 0 is a, 1 is b
  for (int i = 0; i < n; i++) {
    int d;
    cin >> d;
    if (d == 0) {
      pq.emplace(pos[i], 0);
    } else {
      pq.emplace(1e9 + 1 - pos[i], 1);
    }
  }
  ll finishtime = 0;
  while (!pq.empty()) {
    auto pp = pq.top();
    pq.pop();
    finishtime = max(finishtime, pp.first);
    if (pp.second == 0) {
      if (a != 0) {
        a--;
        pq.emplace(pp.first + (1e9 + 1), 1);
      }
    } else {
      if (b != 0) {
        b--;
        pq.emplace(pp.first + (1e9 + 1), 0);
      }
    }
  }
  cout << finishtime + ans << endl;
}