#include<iostream>
#include<vector>
#include<algorithm>
#define rep(i,n) for(i=0;i<(int)(n);i++)
using namespace std;
typedef long long ll;

typedef pair<int,int> p;

int n,s;

int main(){
    int i,j;
    vector<p> a;
    vector<int> ans;
    scanf("%d%d",&n,&s);
    rep(i,n){
        scanf("%d",&j);
        a.push_back(p(j,i+1));
    }
    sort(a.begin(),a.end());
    rep(i,n){
        if(i-1>=0&&abs(a[i-1].first-a[i].first)<=s)
            continue;
        if(i+1<n&&abs(a[i+1].first-a[i].first)<=s)
            continue;
        ans.push_back(a[i].second);
    }
    printf("%d\n",(int)ans.size());
    if(ans.size()){
        sort(ans.begin(),ans.end());
        rep(i,ans.size()-1)
            printf("%d ",ans[i]);
        printf("%d\n",ans[i]);
    }
    return 0;
}