#include<fstream>
#include<algorithm>
using namespace std;
ifstream cin("swiss.in");
ofstream cout("swiss.out");
int n,r,q,i,k;
class node
{
public:
	int s,w,number;
}ar[200001];
bool cmp(node x,node y)
{
	return ((x.s>y.s)||(x.s==y.s&&x.number>y.number));
}
int main()
{
	cin>>n>>r>>q;
	n*=2;
	for(i=1;i<=n;i++)
		cin>>ar[i].s,ar[i].number=i;
	for(i=1;i<=n;i++)
		cin>>ar[i].w;
	for(k=1;k<=r;k++)
	{
		sort(ar+1,ar+n+1,cmp);
		for(i=1;i<=n;i+=2)
		{
			if(ar[i].w>ar[i+1].w)
				ar[i].s++;
			else
				ar[i+1].s++;
		}
	}
	cout<<ar[q].s<<ar[q].w<<ar[q].number<<endl;
	cin.close();
	cout.close();
	return 0;
}