#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<cstdio>
#include<queue>
#include<map>
#include<vector>
#include<set> 
#define inf 0x7fffffff
#define ll long long
#define ull unsigned long long
#define fi first
#define se second
using namespace std;
struct node
{
	int s,w,id;
}e[200010];
int n,r,q;
bool cmp(node a,node b){if(a.s!=b.s)return a.s>b.s;return a.id<b.id;}
int main()
{
	freopen("swiss.in","r",stdin);
	freopen("swiss.out","w",stdout); 
	scanf("%d%d%d",&n,&r,&q);n=n*2;
	for(int i=1;i<=n;i++)scanf("%d",&e[i].s),e[i].id=i;
	for(int i=1;i<=n;i++)scanf("%d",&e[i].w);
	while(r--){
		sort(e+1,e+1+n,cmp);
		for(int i=1;i<=n;i+=2)
		  if(e[i].w>e[i+1].w)e[i].s++;
		  else e[i+1].s++;
	}sort(e+1,e+1+n,cmp);
	printf("%d\n",e[q].id);return 0;
}