Marmot found a row with n pillars. The i-th pillar has the height of hi meters. Starting from one pillar i1, Marmot wants to jump on the pillars i2, ..., ik. (1 ≤ i1 < i2 < ... < ik ≤ n). From a pillar i Marmot can jump on a pillar j only if i < j and |hi - hj| ≥ d, where |x| is the absolute value of the number x.

Now Marmot is asking you find out a jump sequence with maximal length and print it.

Input

The first line contains two integers n and d (1 ≤ n ≤ 105, 0 ≤ d ≤ 109).

The second line contains n numbers h1, h2, ..., hn (1 ≤ hi ≤ 1015).

Output

The first line should contain one integer k, the maximal length of a jump sequence.

The second line should contain k integers i1, i2, ..., ik (1 ≤ i1 < i2 < ... < ik ≤ n), representing the pillars' indices from the maximal length jump sequence.

If there is more than one maximal length jump sequence, print any.

Examples

Input

5 2
1 3 6 7 4


Output

4
1 2 3 5 


Input

10 3
2 1 3 6 9 11 7 3 20 18


Output

6
1 4 6 7 8 9 

Note

In the first example Marmot chooses the pillars 1, 2, 3, 5 with the heights 1, 3, 6, 4. Another jump sequence of length 4 is 1, 2, 4, 5.
#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline T Max(T a, T b) {
  return a > b ? a : b;
}
template <typename T>
inline T Min(T a, T b) {
  return a < b ? a : b;
}
long long N, D, h[100005], nh[100005], dp[100005], ans[100005], pre[100005];
pair<long long, long long> a[100005];
pair<long long, long long> tr[100005 << 2];
void pushdown(int pos) {}
void pushup(int pos) {
  tr[pos] = tr[(pos) << 1];
  if (tr[pos].second < tr[(pos) << 1 | 1].second) {
    tr[pos] = tr[(pos) << 1 | 1];
  }
}
void build(int pos, int l, int r) {
  tr[pos].first = 0;
  tr[pos].second = 0;
  if (l == r) {
    return;
  }
  int mid = (l + r) >> 1;
  build((pos) << 1, l, mid);
  build((pos) << 1 | 1, mid + 1, r);
}
void update(int pos, int l, int r, int L, int R,
            pair<long long, long long> now) {
  if (l <= L && R <= r) {
    tr[pos] = now;
    return;
  }
  pushdown(pos);
  int mid = (L + R) >> 1;
  if (mid >= l) update((pos) << 1, l, r, L, mid, now);
  if (mid < r) update((pos) << 1 | 1, l, r, mid + 1, R, now);
  pushup(pos);
}
pair<long long, long long> query(int pos, int l, int r, int L, int R) {
  if (l <= L && R <= r) {
    return tr[pos];
  }
  pushdown(pos);
  int mid = (L + R) >> 1;
  pair<long long, long long> now = make_pair(0, 0);
  if (mid >= l) {
    pair<long long, long long> tmp = query((pos) << 1, l, r, L, mid);
    if (tmp.second > now.second) {
      now = tmp;
    }
  }
  if (mid < r) {
    pair<long long, long long> tmp = query((pos) << 1 | 1, l, r, mid + 1, R);
    if (tmp.second > now.second) {
      now = tmp;
    }
  }
  return now;
}
struct Node {
  int pos, rank;
  long long h, l, r;
  bool operator<(const Node &next) const { return pos < next.pos; }
} p[100005];
void work() {
  for (int i = 1; i <= N; i++) {
    cin >> h[i];
    a[i] = make_pair(h[i], i);
  }
  sort(a + 1, a + 1 + N);
  for (int i = 1; i <= N; i++) {
    nh[i] = a[i].first;
  }
  for (int i = 1; i <= N; i++) {
    p[i].pos = a[i].second, p[i].h = a[i].first, p[i].rank = i;
    long long l = p[i].h - D, r = p[i].h + D;
    p[i].r = lower_bound(nh + 1, nh + 1 + N, r) - nh;
    p[i].l = upper_bound(nh + 1, nh + 1 + N, l) - nh;
    if (p[i].l) {
      p[i].l--;
    }
  }
  sort(p + 1, p + 1 + N);
  build(1, 1, N);
  for (int i = 1; i <= N; i++) {
    pair<long long, long long> now = make_pair(0, 0);
    if (p[i].l) {
      pair<long long, long long> tmp = query(1, 1, p[i].l, 1, N);
      if (now.second < tmp.second) {
        now = tmp;
      }
    }
    if (p[i].r <= N) {
      pair<long long, long long> tmp = query(1, p[i].r, N, 1, N);
      if (now.second < tmp.second) {
        now = tmp;
      }
    }
    ans[i] = now.second + 1;
    pre[i] = now.first;
    update(1, p[i].rank, p[i].rank, 1, N, make_pair(i, ans[i]));
  }
  int MaxLen = 0, start;
  for (int i = 1; i <= N; i++) {
    if (MaxLen < ans[i]) {
      start = i;
      MaxLen = ans[i];
    }
  }
  vector<int> last;
  while (start) {
    last.push_back(start);
    start = pre[start];
  }
  reverse(last.begin(), last.end());
  cout << MaxLen << endl;
  for (int i = 0; i < last.size(); i++) {
    if (i) cout << " ";
    cout << last[i];
  }
  cout << endl;
}
int main() {
  ios::sync_with_stdio(false);
  while (cin >> N >> D) {
    work();
  }
  return 0;
}
