#include<bits/stdc++.h>
#define MAXA 200005
using namespace std;
 
struct RX {
	int s;
	int level;
	int num;
}win[MAXA],lose[MAXA],a[MAXA];
int n,r,q;
bool cmp(const RX &a,const RX &b) {
	return (a.s == b.s) ? (a.num < b.num) : (a.s > b.s);
}
void merge_sort(int W,int L) {
	int Left = 1,Right = 1,i = 1;
	while(Left < W && Right < L) {
		if(cmp(win[Left],lose[Right]))
		   a[i++] = win[Left++];
		else a[i++] = lose[Right++];
	}
	while(Left < W) 
	      a[i++] = win[Left++];
	while(Right < L)
	      a[i++] = lose[Right++];
}
 
int main() {
	scanf("%d %d %d",&n,&r,&q);
	n <<= 1;
	for(int i=1;i<=n;i++) {
		scanf("%d",&a[i].s);
		a[i].num = i;
	}
	for(int i=1;i<=n;i++)
	    scanf("%d",&a[i].level);
	sort(a+1,a+n+1,cmp);
	
	for(int i=1;i<=r;i++) {
		int W = 1,L = 1;
		for(int j=1;j<=n;j+=2) {
			if(a[j].level > a[j+1].level) {
				a[j].s++;
			    win[W++] = a[j];
			    lose[L++] = a[j+1];
			}
			else {
				a[j+1].s++;
				win[W++] = a[j+1];
				lose[L++] = a[j];
			}
		}
		merge_sort(W,L);
	}
	printf("%d",a[q].num);
}