#include<iostream>
#include<vector>
#include<algorithm>
#include<map>
using namespace std;
int main()
{
  int n,s;
  cin >> n >> s;
  if(n==1){
    cout << 1 << endl;
    cout << 1 << endl;
    return 0;
  }
  vector<int>a(n);
  for(int i=0;i<n;i++)cin >> a[i];
  vector<int>b=a;
  sort(a.begin(),a.end());
  vector<bool>ans(n,false);
  if(a[1]-a[0]<=s)ans[0]=true;
  if(a[n-1]-a[n-2]<=s)ans[n-1]=true;
  for(int i=1;i<n-1;i++)if(a[i]-a[i-1]<=s || a[i+1]-a[i]<=s)ans[i]=true;
  map<int,bool>dict;
  for(int i=0;i<n;i++){
    if(ans[i])dict[a[i]]=true;
    else dict[a[i]]=false;
  }
  int cnt=0;
  for(int i=0;i<n;i++)if(dict[b[i]]==false)cnt++;
  cout << cnt << endl;
  for(int i=0;i<n;i++)if(dict[b[i]]==false)cout << i+1 << " ";
  cout << endl;
}