#include <iostream>
#include <algorithm>
using namespace std;
pair<int, int> a[1000002];
int b[1000002]; long long n, k, t, j, t1, t2;
int main()
{
	cin >> n >> k;
	for (int i = 1; i <= n; i++) {
		cin >> t;  a[i].first = t;
		a[i].second = i;
	}
	sort(a + 1, a + n + 1);
	for (int i = 1; i <= n; i++) {
		b[i] = a[i].first;
	}
	for (int i = 1; i <= n; i++) {
		t1 = b[i] - k;
		t2 = b[i] + k;
		if (lower_bound(b + 1, b + n + 1, t1) < upper_bound(b + 1, b + n + 1, t1))
		{
			int vt = lower_bound(b + 1, b + n + 1, t1) - b;
			cout << a[i].second << " " << a[vt].second;
			return 0;
		}
		if (lower_bound(b + 1, b + n + 1, t2) < upper_bound(b + 1, b + n + 1, t2))
		{
			int vt = lower_bound(b + 1, b + n + 1, t2) - b;
			cout << a[vt].second << " " << a[i].second;
			return 0;
		}
	}
	cout << "0 0";
	return 0;
}