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

#define rep(i, n) for (int i = 0; i < (int)n; i++)
using pii = pair<int, int>;

int main() {
  int n, s;
  cin >> n >> s;
  vector<pii> p(n);
  rep(i, n) {
    int pi;
    cin >> pi;
    p[i] = {pi, i};
  }
  sort(p.begin(), p.end());
  vector<int> q;
  if (n == 1)
    q.push_back(0);
  else {
    if (p[1].first - p[0].first > s) {
      q.push_back(p[0].second);
    }
    for (int i = 1; i < n-1; i++) {
      if (p[i].first - p[i-1].first > s &&
	  p[i+1].first - p[i].first > s)
	q.push_back(p[i].second);
    }
    if (p[n-1].first - p[n-2].first > s) {
      q.push_back(p[n-1].second);
    }
  }
  sort(q.begin(), q.end());
  cout << (int)q.size() << endl;
  for (int i : q)
    cout << i+1 << " ";
  if ((int)q.size() > 0)
    cout << endl;
  return 0;
}