#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
  int n, s;
  cin >> n >> s;
  vector<pair<int, int>> p(n);
  for (int i = 0; i < n; ++i)
  {
    cin >> p[i].first;
    p[i].second = i;
  }
  sort(p.begin(), p.end());
  vector<int> ans;
  for (int i = 0; i < n; ++i)
  {
    int flag = 1;
    if (i > 0 && abs(p[i - 1].first - p[i].first) <= s) flag = 0;
    if (i + 1 < n && abs(p[i + 1].first - p[i].first) <= s) flag = 0;
    if (flag) ans.push_back(p[i].second + 1);
  }
  sort(ans.begin(), ans.end());
  cout << ans.size() << endl;
  for (auto v : ans) cout << v << ' ';
  cout << endl;
}