#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, s; cin >> n >> s;
	vector<P>p(n);
	rep(i, n) {
		cin >> p[i].first;
		p[i].second = i;
	}
	sort(all(p));
	vector<int>ans;
	rep(i, n) {
		bool chk = true;
		if (0 != i) {
			if (abs(p[i].first - p[i - 1].first) <= s)chk = false;
		}
		if (n - 1 != i) {
			if (abs(p[i].first - p[i + 1].first) <= s)chk = false;
		}
		if (chk)ans.push_back(p[i].second);
	}
	sort(all(ans));
	cout << ans.size() << endl;
	rep(i, ans.size())cout << ans[i] + 1 << " ";
	cout << endl;
	return 0;
}