#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n, s; cin >> n >> s;
  vector<int> p(n);
  for (int& p_i : p) cin >> p_i;
  vector<int> ord(n);
  iota(ord.begin(), ord.end(), 0);
  ranges::sort(ord, {}, [&](const int i) -> int { return p[i]; });
  vector<int> ans;
  REP(i, n) {
    if ((i == 0 || p[ord[i]] - p[ord[i - 1]] > s) && (i + 1 == n || p[ord[i + 1]] - p[ord[i]] > s)) {
      ans.emplace_back(ord[i]);
    }
  }
  ranges::sort(ans);
  const int m = ans.size();
  cout << m << '\n';
  REP(i, m) cout << ans[i] + 1 << " \n"[i + 1 == m];
  return 0;
}