#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i)
#define rep(i, n) drep(i, 0, n - 1)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second
mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
const ll MOD1000000007 = 1000000007;
const ll MOD998244353 = 998244353;
const ll MOD[3] = {999727999, 1070777777, 1000000007};
const ll LINF = 1LL << 60LL;
const int IINF = (1 << 30) - 1;


void solve(){
    int n, s; cin >> n >> s;
    vector<pair<int, int>> p(n);
    for(int i=0; i<n; i++){
        cin >> p[i].fi;
        p[i].se = i;
    }
    sort(all(p));
    vector<int> ans;
    for(int i=0; i<n; i++){
        bool flg = true;
        if(i>0){
            if(p[i].fi-p[i-1].fi<=s) flg = false;
        }
        if(i<n-1){
            if(p[i+1].fi-p[i].fi<=s) flg = false;
        }

        if(flg) ans.pb(p[i].se);
    }
    sort(all(ans));
    cout << (int)ans.size() << '\n';
    for(int i : ans) cout << i+1 << ' ';
    cout << '\n';
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    
    int T=1;
    //cin >> T;
    while(T--) solve();
}