#include<bits/stdc++.h>
using namespace std;
struct node{
    int power,score,id;
};
bool cmp(node a,node b){
	if(a.score==b.score) return a.id<b.id;
	return a.score>b.score;
}
int main(){
    int n,r,q;
    cin>>n>>r>>q;
    node a[2*n];
    for(int i=0;i<2*n;i++){
		cin>>a[i].score;
		a[i].id=i+1;
	}
    for(int i=0;i<2*n;i++) cin>>a[i].power;
    for(int i=0;i<r;i++){
    	sort(a,a+2*n,cmp);
    	for(int i=0;i<n;i++){
    		if(a[2*i].power>=a[2*i+1].power) a[2*i].score++;
    		else a[2*i+1].score++;
		}
	}
	sort(a,a+2*n,cmp);
	cout<<a[q-1].id;
}

被卡死了，嘤嘤嘤