#include <bits/stdc++.h>
using namespace std;
#define int long long
//#define endl "\n"
#define PII pair<int,int>
#define PIS pair<int,string>
#define fr(i,xxx,yyy) for(int i=xxx,ppp=yyy;i<=ppp;i++)
#define rp(i,xxx,yyy) for(int i=xxx,ppp=yyy;i>=ppp;i--)
const int N=1e6+10;
const int M=1e9+1;
int mod=998244353;
int a[N],b[N],c[N],d[N],l[N],r[N];
int f[N];
void solve() {
	int n,p,q;
	cin>>n>>p>>q;
	fr(i,1,n) {
		cin>>a[i];
	}
	int na=0,nb=0;
	fr(i,1,n) {
		cin>>b[i];
		if(b[i]==1)r[nb++]=M-a[i];
		else l[na++]=a[i];
	}
	int t=0;
	int num=min((p+n-1)/n,(q+n-1)/n);
	t+=2*M*(num-1);
	p-=n*(num-1);
	q-=n*(num-1);
	int ans=n;
	sort(l,l+na);
	sort(r,r+nb);
	fr(i,1,na){
		b[i]=0;
		d[i]=l[i-1];
	}fr(i,na+1,na+nb){
		b[i]=1;
		d[i]=r[i-na-1];
		d[i]=M-d[i];
	}
	
	while(ans) {
		fr(i,1,n) {
			if(f[i])continue;
			if(b[i]==0) {
				int s=d[i];
				d[i]=0;
				c[i]+=s;
				b[i]=1;
				if(p==0) {
					f[i]=1;
					ans--;
					if(ans==0)t+=c[i];
					continue;
				}
				p--;
			}
			else if(b[i]==1) {
				int s=M-d[i];
				d[i]=M;
				c[i]+=s;
				b[i]=0;
				if(q==0) {
					f[i]=1;
					ans--;
					if(ans==0)t+=c[i];
					continue;
				}
				q--;
			}
		}
	}cout<<t;
}
signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0),cout.tie(0);
	int n=1;
	//cin>>n;
	while(n--)
		solve();
	return 0;
}