#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
const ll nmax = 1e6 + 1;

pair<ll, ll> a[100005], b[100005];
ll n, k;
int main()
{

  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);

  cin >> n >> k;
  for (ll i = 1; i <= n; ++i) cin >> a[i].first;
  for (ll i = 1; i <= n; ++i)
  {
    a[i].second = i;
    b[i].first = a[i].first;
    b[i].second = 0;
  }
  sort(a + 1, a + n + 1);
  ll L = 1, R = 1;
  ll dau = L, cuoi = R;
  while (R <= n)
  {
    while (a[R + 1].first - a[L].first <= k && R < n)
      R++;
    if (R - L >= cuoi - dau)
    {
      dau = L;
      cuoi = R;
    }
    R++;

    if (R <= n)
      while (a[R].first - a[L].first > k && L < R)
        L++;
  }

  for (ll i = dau; i <= cuoi; ++i) b[a[i].second].second = 1;

  cout << n - (cuoi - dau + 1) << '\n';
  for (ll i = 1; i <= n; ++i)
  {
    if (b[i].second == 0)
      cout << i << ' ';
  }
  return 0;
}