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

vector<int> v;
struct node {
	int x;
	int y;
} a[200001];
int b[200001];

bool cmp(node &a,node &b) {
	return a.x<b.x;
}

void solve() {
	int n,s;cin>>n>>s;
	if(n==1) {
		cout<<"1"<<"\n"<<"1";
		return;
	}
	for(int i=1;i<=n;++i) {
		 cin>>a[i].x;
		 a[i].y=i;
	}
	sort(a+1,a+1+n,cmp);
	for(int i=1;i<=n;++i) {
		b[i]=a[i].x-a[i-1].x;
	}
	b[1]=b[n+1]=s+1;
	for(int i=1;i<=n;++i) {
		if(b[i]>s&&b[i+1]>s) v.push_back(a[i].y);
	}
	cout<<v.size()<<"\n";
	sort(v.begin(),v.end());
	for(auto &i:v) {
		cout<<i<<" ";
	}
}
 
int main() {
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	int _;_=1;
	while(_--) solve();
	return 0;
}