#include <iostream>
using namespace std;
 
int main() {
	int n, k;
 
	cin >> n >> k;
 
	int array[n];
	for (int i = 0; i < n; i++){
		cin >> array[i];
	}
 
	int all[n];
	for (int i = 0; i < n; i++){
		all[n] = 0;
	}
 
	for (int i = 0; i < n; i++){
		int lr, hr;
		lr = array[i] - k;
		hr = array[i] + k;
 
		for (int j = 0; j < n; j++){
			if (lr <= array[j] and array[j] <= hr){
				all[i] += 1;
			}
		}	
	}
 
	int max = -1;
	for (int i = 0; i < n; i++){
		if (all[i] > max){
			max = array[i];
		}
	}
 
	cout << max;
	return 0;
}

I2luY2x1ZGUgPGlvc3RyZWFtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IG1haW4oKSB7CglpbnQgbiwgazsKCgljaW4gPj4gbiA+PiBrOwoKCWludCBhcnJheVtuXTsKCWZvciAoaW50IGkgPSAwOyBpIDwgbjsgaSsrKXsKCQljaW4gPj4gYXJyYXlbaV07Cgl9CgkKCWludCBhbGxbbl07Cglmb3IgKGludCBpID0gMDsgaSA8IG47IGkrKyl7CgkJYWxsW25dID0gMDsKCX0KCglmb3IgKGludCBpID0gMDsgaSA8IG47IGkrKyl7CgkJaW50IGxyLCBocjsKCQlsciA9IGFycmF5W2ldIC0gazsKCQlociA9IGFycmF5W2ldICsgazsKCgkJZm9yIChpbnQgaiA9IDA7IGogPCBuOyBqKyspewoJCQlpZiAobHIgPD0gYXJyYXlbal0gYW5kIGFycmF5W2pdIDw9IGhyKXsKCQkJCWFsbFtpXSArPSAxOwoJCQl9CgkJfQkKCX0KCglpbnQgbWF4ID0gLTE7Cglmb3IgKGludCBpID0gMDsgaSA8IG47IGkrKyl7CgkJaWYgKGFsbFtpXSA+IG1heCl7CgkJCW1heCA9IGFycmF5W2ldOwoJCX0KCX0KCgljb3V0IDw8IG1heDsKCXJldHVybiAwOwp9

NSAzCjEgCjYKNAozCjE=

5 3
1 
6
4
3
1