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

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  ll N, K;
  cin >> N >> K;

  vector<ll> A(N);
  for(auto &i : A) { cin >> i; }

  vector<ll> idx(N);
  iota(idx.begin(), idx.end(), 0);
  ranges::sort(idx, [&](auto i, auto j) { return A[i] < A[j]; });
  ranges::sort(A);

  vector<ll> ans;
  for(ll i = 0; i < N; i++) {
    if(ranges::upper_bound(A, A[i] + K) - ranges::lower_bound(A, A[i] - K) == 1) { ans.emplace_back(idx[i]); }
  }

  ranges::sort(ans);
  cout << ans.size() << "\n";
  for(auto &i : ans) { cout << ++i << " "; }
}