#include <bits/stdc++.h>
using namespace std;

using ll = long long;
#define rep(i, n) for(int i = 0; i < n; i++)

int main() {
	int N, s;
	cin >> N >> s;
	using P = pair<int, int>;
	vector<P> p(N);
	rep(i, N) {
		int a;
		cin >> a;
		p[i] = P(a, i);
	}
	sort(p.begin(), p.end());
	vector<int> ans;
	if(N == 1) ans.push_back(p[0].second);
	else {
		rep(i, N) {
			if(i == 0) {
				if(i + 1 < N && abs(p[i].first - p[i + 1].first) > s) ans.push_back(p[i].second);
			}
			else if(i == N - 1) {
				if(i - 1 >= 0 && abs(p[i].first - p[i - 1].first) > s) ans.push_back(p[i].second);
			}
			else {
				if(i + 1 < N && i - 1 >= 0 && abs(p[i].first - p[i + 1].first) > s && abs(p[i].first - p[i - 1].first) > s)
					ans.push_back(p[i].second);
			}
		}
	}
	int sz = ans.size();
	sort(ans.begin(), ans.end());
	cout << sz << endl;
	rep(i, sz) {
		if(i) cout << " ";
		cout << ans[i] + 1;
	}
	cout << endl;
}