#

#include<bits/stdc++.h>
using namespacece std;
int n,r,q;
struct play
{
	int s;
	int w;
	int id; 
}a[100005];
bool cmp(play i,play j)
{
	if(i.s==j.s)
	{
		return i.id<j.id;
	}
	else
	{
		return i.s>j.s;
	}
}
int main()
{
	cin>>n>>r>>q;
	n*=2;
	for(int i=1;i<=n;i++)
	{
		cin>>a[i].s;
		a[i].id=i;
	}
	for(int i=1;i<=n;i++)
	{
		cin>>a[i].w;
	}
	sort(a+1,a+1+n,cmp);
	while(r--)
	{
		for(int i=1;i<=n;i+=2)
		{
			if(a[i].w>a[i+1].w)
			{
				a[i].s++;
			}
			else
			{
				a[i+1].s++;
			}
		}
		sort(a+1,a+1+n,cmp);
	}
	cout<<a[q].id;
	return 0;
}