#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,m,n) for(int i=m; i<int(n); ++i)
#define repll(i,m,n) for(ll i=m; i<ll(n); ++i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define fi first
#define se second

template<typename T> bool chmin(T& a, T b){ if(a > b){a = b; return true;} return false; }
template<typename T> bool chmax(T& a, T b){ if(a < b){a = b; return true;} return false; }

template<typename T> T gcd(T a, T b){ return a % b ? gcd(b, a % b) : b; }
template<typename T> T lcm(T a, T b){ return a / gcd(a, b) * b; }

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int N, S;
    cin >> N >> S;
    vector<pair<int, int>> P;
    rep(i, 0, N){
        int p;
        cin >> p;
        P.push_back({p, i+1});
    }

    vector<int> ans;
    sort(all(P));

    rep(i, 0, N){
        bool flag = true;
        if(i > 0 && abs(P[i].fi - P[i-1].fi) <= S) flag = false;
        if(i < N-1 && abs(P[i].fi - P[i+1].fi) <= S) flag = false;
        if(flag) ans.push_back(P[i].se);
    }

    sort(all(ans));
    int sz = ans.size();

    cout << sz << endl;
    rep(i, 0, sz){
        cout << ans[i];
        cout << (i == sz-1 ? '\n' : ' ');
    }

    return 0;
}