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

int main(){

    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    ll N,S;
    cin>>N>>S;
    vector<pair<ll,ll>> P(N);
    for(int i=0;i<N;i++){
        cin>>P[i].first;
        P[i].second=i;
    }
    sort(P.begin(),P.end());
    vector<int> AN;
    for(int i=0;i<N;i++){
        bool OK=1;
        if(i!=0&&P[i].first-P[i-1].first<=S)OK=0;
        if(i!=N-1&&P[i+1].first-P[i].first<=S)OK=0;
        if(OK)AN.push_back(P[i].second);
    }
    sort(AN.begin(),AN.end());
    ll an=AN.size();
    cout<<an<<endl;
    for(int i=0;i<an;i++)cout<<AN[i]+1<<" \n"[i==an-1];
    

}