#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;


int n, L, R;
int len = 1'000'000'001;
VI a, d;

LL ht(int i, LL t)
{
	LL ds = a[i];
	if (d[i] == 1)
		ds += 2 * (len - a[i]);
	if (ds > t)
		return 0;
	return 1 + (t - ds) / (2 * len);
}


LL solve(int f)
{
	if (f)
	{
		swap(L, R);
		FOR (i, 0, n)
		{
			a[i] = len - a[i];
			d[i] = 1 - d[i];
		}
	}
	LL l = 0, r = 1e18;
	while (l + 1 < r)
	{
		LL m = (l + r) / 2;
		LL hits = 0;
		FOR (i, 0, n)
		{
			hits += ht(i, m);
		}
		if (hits >= L)
			r = m;
		else
			l = m;
	}
	if (f)
	{
		swap(L, R);
		FOR (i, 0, n)
		{
			a[i] = len - a[i];
			d[i] = 1 - d[i];
		}
	}
	return r;
}	

int pos(int i, LL t)
{
	t %= 2 * len;
	LL ps = a[i];
	int dir = d[i];
	//cerr << "POS\n";
	//cerr << ps << ' ' << dir << ' ' << t << '\n';
	if (d[i] == 0)
	{
		LL x = min(ps, t);
		ps -= x;
		t -= x;
		if (ps == 0)
			dir = 1;
		ps += t;
		if (ps >= len)
		{
			dir = 0;
			ps = 2 * len - ps;
		}
	}
	else
	{
		LL x = min(len - ps, t);
		ps += x;
		t -= x;
		if (ps == len)
			dir = 0;
		ps -= t;
		if (ps <= 0)
		{
			dir = 1;
			ps = abs(ps);
		}
	}
	//cerr << ps << ' ' << dir << ' ' << t << '\n';
	if (dir == 1)
		return 2 * (len - ps) + ps;
	return ps;
}

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n >> L >> R;
	a.resize(n);
	d.resize(n);
	FOR (i, 0, n)
		cin >> a[i];
	FOR (i, 0, n)
		cin >> d[i];
	
	LL t1 = solve(0);
	LL t2 = solve(1);
	
	//cerr << t1 << ' ' << t2 << '\n';
	
	vector<LL> ans(n);
	FOR (i, 0, n)
	{
		ans[i] = t1 + pos(i, t1);
		a[i] = len - a[i];
		d[i] = 1 - d[i];
		ans[i] = min(ans[i], t2 + pos(i, t2));
	}
	cout << *max_element(ALL(ans)) << '\n';
	
	return 0;
}