#include <bits/stdc++.h>
#define int long long

using namespace std;

constexpr int L = 1E9 + 1;

void solve () {
    int n, x, y;
    cin >> n >> x >> y;

    vector <int> a (n), d (n);
    for (int i = 0; i < n; i ++) {
        cin >> a[i];
    }
    for (int i = 0; i < n; i ++) {
        cin >> d[i];
    }

    int t = min (x, y) / n;
    int ans = t * L * 2;
    x -= t * n;
    y -= t * n;

    vector <pair <int, int>> b (n);
    for (int i = 0; i < n; i ++) {
        b[i].first = d[i] == 0 ? a[i] : (L - a[i]);
        b[i].second = d[i];
    }
    sort (b.begin (), b.end ());

    int num = n;
    while (num) {
        vector <pair <int, int>> nb;
        for (auto [c, o] : b) {
            if (o == 0) {
                if (x != 0) {
                    x --;
                    nb.push_back ({c, o ^ 1});
                } else {
                    num --;
                }
            } else {
                if (y != 0) {
                    y --;
                    nb.push_back ({c, o ^ 1});
                } 
            }
            if (num == 0) {
                cout << ans + c << '\n';
                return;
            }
        }
        ans += L;
        b = move (nb);
    }

    cout << ans << '\n';
}

signed main () {
    ios::sync_with_stdio (false);
    cin.tie (nullptr);

    int T = 1;
    // cin >> T;

    while (T --) {
        solve ();
    }

    return 0;
}