#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
struct player{
	int num;
	int power;
	int point;
};
player a[200010];
int n,r,q;
int main(){
	cin>>n>>r>>q;
	for(int w=1;w<=2*n;w++)
	{
		cin>>a[w].point;
		a[w].num=w;
	}
	for(int w=1;w<=2*n;w++)
	{
		cin>>a[w].power;
	}
	for(int w=1;w<=r;w++)
	{
		for(int e=1;e<=2*n;e+=2)
		{
			if(a[e].power>a[e+1].power) a[e].point++;
			else a[e+1].point++;
		}
	}
	for(int w=1;w<=2*n;w+=2)
	{
		if(a[w].point>a[w+1].point||(a[w].point==a[w+1].point&&a[w].num<a[w+1].num)) swap(a[w],a[w+1]);
	}
	cout<<a[q].num;
    return 0;
}