#include<iostream>
#include<cstring>
#include<cmath>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<queue>
#include<stdio.h>
using namespace std;
const int maxn=100000;
int n,r,q;
struct player{
	int s,w,number;
};
player a[2*maxn];
int main()
{
	ios::sync_with_stdio(0);
	cin>>n>>r>>q;
	for(int i=1;i<=n;i++){
		cin>>a[i].s;
		a[i].number=i;
	}
	for(int i=1;i<=n;i++)
		cin>>a[i].w;
	sort(a,a+n);
	for(int i=1;i<=r;i++){
		for(int j=1;j<=n;j+=2){
			if(a[j].w>a[j+1].w)
				a[j].s=1+a[j].s;
			else
				a[j+1].s=1+a[j+1].s;
		}
		sort(a,a+n);
	}
	cout<<a[q].number;
	return 0;
}