#include<iostream>

#include<string>
#include<algorithm>
using namespace std;
typedef struct people {
    int shili = 0;
    int fen = 0;
    int bianhao = 0;
};
bool cmp(people a, people b) {
    if (a.fen != b.fen)
        return a.fen > b.fen;
    else
        return a.bianhao < b.bianhao;
}
int main() {
    int N = 0, R =0, Q=0;
    cin >> N >> R >> Q;
    int fenshu, shili;
    people ppp[200000];
    for (int i = 0; i < (2*N); i++) {
        cin >> fenshu;
        ppp[i].bianhao = i + 1;
        ppp[i].fen = fenshu;
    }
    for (int i = 0; i < (2*N); i++) {
        cin >> shili;
        ppp[i].shili= shili;
    }
    sort(ppp, ppp + (2*N), cmp);
    for (int i = 0; i < R; i++) {//轮次
        for (int j = 0; j < 2*N; j+=2) {//比较
            if (ppp[j].shili > ppp[j + 1].shili) {
                ppp[j].fen++;
            }
            else {
                ppp[j + 1].fen++;
            }
        }
        sort(ppp, ppp + (2 * N), cmp);
    }
    cout << ppp[Q - 1].bianhao;
    return 0;
}