#include <bits/stdc++.h>
#include <atcoder/all>
using mint = atcoder::static_modint<998244353>;
//using mint = atcoder::static_modint<1000000007>;
using namespace std;
using namespace atcoder;
using ld = long double;
using ll = long long;
#define mp(a,b) make_pair(a,b)
#define rep(i,s,n) for(int i=s; i<n; i++)
const vector<int> dx{1,0,-1,0},dy{0,1,0,-1};

template<typename T>
void compress(vector<T>&a, bool is_unique=false){
    auto b=a;
    sort(b.begin(),b.end());
    if(is_unique){
        auto p=unique(b.begin(),b.end());
        b.erase(p,b.end());
    }
    for(auto&x:a)x=lower_bound(b.begin(),b.end(),x)-b.begin();
}

int main(){
    int n,s;
    cin >> n >> s;
    vector<pair<int,int>> a(n);
    rep(i,0,n)cin >> a[i].first,a[i].second=i;
    sort(a.begin(),a.end());
    vector<int> ans;
    rep(i,0,n){
        bool isolate=true;
        if(i>0 && a[i].first-a[i-1].first<=s)isolate=false;
        if(i<n-1 && a[i+1].first-a[i].first<=s)isolate=false;
        if(isolate)ans.push_back(a[i].second+1);
    }
    sort(ans.begin(),ans.end());
    cout << ans.size() << "\n";
    for(auto x:ans)cout << x<< " ";
    
}