#include<bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
    int N,D;
    cin>>N>>D;
    vector<pair<int,int>> S(N);
    for(int i=0;i<N;i++){
    	cin>>S[i].first;
    	S[i].second = i;
    }
    sort(S.begin(),S.end());
    vector<int> Ans = {};
    for(int i=0;i<N;i++){
    	bool p = true;
    	if(i && S[i].first-S[i-1].first <= D) p = false;
    	if(i != N-1 && S[i+1].first-S[i].first <= D) p = false;
    	if(p) Ans.push_back(S[i].second+1);
    }
    sort(Ans.begin(),Ans.end());
    cout<<Ans.size()<<endl;
    for(int x:Ans) cout<<x<<' ';
    cout<<endl;
}