#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 s1 = 0, s2 = 0;
    ans += b.back ().first;
    for (auto [c, o] : b) {
        if (o == 0) {
            if (x != 0) {
                x --;
                s1 ++;
            } 
        } else {
            if (y != 0) {
                y --;
                s2 ++;
            } 
        }
    }
    // cerr << s1 << " " << s2 << " " << x << " " << y << '\n';

    while (s1 || s2) {
        ans += L;
        swap (s1, s2);
        if (x) {
            int t = min (x, s1);
            x -= t;
            if (x) {
                s1 -= t;
            } else {
                s1 = 0;
            }
        } else {
            s1 = 0;
        }
        if (y) {
            int t = min (y, s2);
            y -= t;
            if (y) {
                s2 -= t;
            } else {
                s2 = 0;
            }
        } else {
            s2 = 0;
        }
    }

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

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

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

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

    return 0;
}