#include<bits/stdc++.h>
using namespace std;

#define ll long long

const int maxn=1e6+10;

int a[maxn];
int d[maxn];

int main()
{
	int n,A,B;ll left,right;
	scanf("%d%d%d",&n,&A,&B);
	for(int i=1;i<=n;i++) scanf("%d",&a[i]);
	for(int i=1;i<=n;i++) scanf("%d",&d[i]);
	int len=2000000002;
	left=0,right=2.1e18;
	while(left<=right)
	{
		ll mid=left+right>>1,cnt=0;
		for(int i=1;i<=n;i++)
			if(d[i]) cnt+=(mid+a[i])/len;
			else cnt+=(mid+len-a[i])/len;
		if(cnt>=A) right=mid-1;
		else left=mid+1;
	}
	ll ta=left;
	left=0,right=2.1e18;
	while(left<=right)
	{
		ll mid=left+right>>1,cnt=0;
		for(int i=1;i<=n;i++)
			if(!d[i]) cnt+=(mid+len/2-a[i])/len;
			else cnt+=(mid+len/2+a[i])/len;
		if(cnt>=B) right=mid-1;
		else left=mid+1;
	}
	ll tb=left;
	if(ta<=tb)
	{
		vector<int> vec;
		int ans=0;
		for(int i=1;i<=n;i++)
		{
			if(!d[i])
			{
				B-=(ta+len/2-a[i])/len;
				a[i]=(ta+len/2-a[i])%len;
			}
			else
			{
				B-=(ta+len/2+a[i])/len;
				a[i]=(ta+len/2+a[i])%len;
			}
			if(a[i]>=len/2) vec.push_back(a[i]);
			else ans=max(ans,len/2-a[i]);
		}
		sort(vec.begin(),vec.end());
		if(!vec.size()) printf("%lld\n",ta+ans);
		else if(B<=0) printf("%lld\n",ta+max(ans,len-vec[0]));
		else printf("%lld\n",ta+len-vec[max(0,(int)(vec.size()-B))]+len/2);
	}
	else
	{
		vector<int> vec;
		int ans=0;
		for(int i=1;i<=n;i++)
		{
			if(!d[i])
			{
				A-=(tb+len-a[i])/len;
				a[i]=(tb+len-a[i])%len;
			}
			else
			{
				A-=(tb+a[i])/len;
				a[i]=(tb+a[i])%len;
			}
			if(a[i]>=len/2) vec.push_back(a[i]);
			else ans=max(ans,len/2-a[i]);
		}
		sort(vec.begin(),vec.end());
		if(!vec.size()) printf("%lld\n",tb+ans);
		else if(A<=0) printf("%lld\n",tb+max(ans,len-vec[0]));
		else printf("%lld\n",tb+len-vec[max(0,(int)(vec.size()-A))]+len/2);
	}
	return 0;
}