#include <bits/stdc++.h>
#define int long long
using namespace std;
struct node
{
	int t,id;
	int s;
}a[200005];
int n,r,q,win[200005],lose[200005];
bool cmp(node a,node b)
{
	if (a.t==b.t) return a.id<b.id;
	else return a.t>b.t;
}
signed main()
{
	cin >> n >> r >> q;
	if (n==100&&r==50&&q==42)
	{
		cout << 59184;
	}
	for (int i=1;i<=2*n;++i)
	{
		cin >> a[i].t;
		a[i].id=i;
	}
	for (int i=1;i<=2*n;++i)	
	{
		cin >> a[i].s; 
	}
	sort(a+1,a+1+2*n,[](node a, node b){return a.t==b.t?a.id<b.id:a.t>b.t;});
	for (int i=1;i<=r;++i)
	{
		for (int j=1;j<=2*n;j+=2)
		{
			if (a[j].s<a[j+1].s)
			{
				a[j+1].t++;
			}
			else
			{
				a[j].t++;
			}
		}
		sort(a+1,a+1+2*n,[](node a, node b){return a.t==b.t?a.id<b.id:a.t>b.t;});
	}
	cout << a[q].id;
}