#include <vector>
#include <iostream>
#include <algorithm>
#include <set>
#include <numeric>

#define pb push_back
#define b begin
#define e end
#define mp make_pair

using namespace std;


int main(){
	int n, m, k;
	cin >> n >> m >> k;
	vector<int> v(n), job(m);
	for (auto& x : v) {
		cin >> x;
	}
	for (auto& x : job) {
		cin >> x;
	}

	int maxx = 0;
	int index = 0;

	for (int i = 0; i < n; ++i) {
		int cur = 0;
		for (int j = 0; j < m; ++j) {
			if (abs(job[j] - v[i]) <= k) ++cur;
		}
		if (cur > maxx) {
			maxx = cur;
			index = i;
		}
	}
	cout << index + 1;

}