#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll const inf = (ll)1e18;
int main () {
	int N, S;
	cin >> N >> S;
	std::vector<ll> P(N + 2) ;
	P[0] = -inf; P[N + 1] = inf;
	for (int i = 0; i <= N; i ++) cin >> P[i];
	vector<int> ID(N + 2);
	iota(ID.begin(), ID.end(), 0);
	sort(ID.begin(), ID.end(), [&](int a, int b) {return P[a] < P[b];});
	vector<int> ans;
	for (int p = 1; p <= N; p ++) {
		int i = ID[p];
		int l = ID[p - 1], r = ID[p + 1];
		if (min(abs(P[l] - P[i]), abs(P[r] - P[i])) > S) {
			ans.push_back(i);
		}
	}
	sort(ans.begin(), ans.end());
	cout << ans.size() << endl;
	for (auto& a : ans) cout << a << " ";
	cout << endl;
}