#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, e) for (int i = (int)(s); i < (int)(e); ++i)
#define all(a) (a).begin(),(a).end()

const ll INF = 1ll << 60;

int main() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    
    int N;
    ll S;
    cin >> N >> S;
    vector<pair<ll, int>> P(N);
    rep(i, 0, N) {
        cin >> P[i].first;
        P[i].second = i;
    }
    P.push_back({-INF, -1});
    P.push_back({INF, -1});
    sort(all(P));
    
    set<int> ans;
    rep(i, 1, N + 1) {
        if (P[i].first - P[i - 1].first > S && P[i + 1].first - P[i].first > S) ans.insert(P[i].second + 1);
    }
    
    cout << ans.size() << '\n';
    for (int t : ans) cout << t << ' ';
    cout << '\n';
}