#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;
using ll = long long;

constexpr int iINF = 1'000'000'000;
constexpr ll llINF = 1'000'000'000'000'000'000;

int main () {
    int N, S; cin >> N >> S;
    vector<int> P(N);
    for (int i = 0; i < N; i++) cin >> P[i];
    vector<int> index(N);
    for (int i = 0; i < N; i++) index[i] = i;

    sort(index.begin(), index.end(), [&](int a, int b) { return P[a] < P[b]; });

    vector<bool> isolated(N);
    int count = 0;
    for (int i = 0; i < N; i++) {
        bool res = true;
        if (0 < i) {
            if (P[index[i]] - P[index[i - 1]] <= S) res = false;
        }
        if (i + 1 < N) {
            if (P[index[i + 1]] - P[index[i]] <= S) res = false;
        }

        isolated[index[i]] = res;
        if (res) count++;
    }

    cout << count << "\n";
    int lat = 0;
    for (int i = 0; i < N; i++) {
        if (!isolated[i]) continue;
        cout << i + 1 << (lat == count - 1 ? '\n' : ' ');
        lat++;
    }
}