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

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

int main(){
	int n; ll s; cin >> n >> s;
	dsu uf(n);

	vector<ll> p(n);
	rep(i,0,n) cin >> p[i];
	vector<pair<ll,int>> tr;
	rep(i,0,n) tr.push_back(pair(p[i], i));
	sort(tr.begin(), tr.end());

	rep(i,0,n-1){
		if(tr[i+1].first - tr[i].first <= s){
			uf.merge(tr[i+1].second, tr[i].second);
		}
	}	
	vector<int> ans;
	rep(i,0,n){
		if(uf.size(i) == 1){
			ans.push_back(i);
		}
	}
	int k = ans.size();
	cout << k << endl;
	rep(i,0,k){
		cout << ans[i]+1 << ' ';
	}

	cout << '\n';

}