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>
#pragma comment(linker, "/STACK:100000000000,100000000000")
using namespace std;
const double eps = 1E-9;
const double Exp = 2.718281828459045;
const double Pi = 3.1415926535897932;
const int NMAX = 100000 + 5;
const int MMAX = 100000 + 5;
const int INF = 1000000000;
const int BASE = 1000000007;
template <typename T>
inline T abs(const T a) {
  if (a < 0) return -a;
  return a;
}
template <typename T>
inline T sqr(const T &a) {
  return a * a;
}
pair<int, long long> t[4 * NMAX];
pair<int, long long> combine(const pair<int, long long> &a,
                             const pair<int, long long> &b) {
  if (a.second > b.second) return a;
  return b;
}
void modify(int v, int tl, int tr, int pos, int val) {
  if (tl == tr) {
    t[v] = combine(t[v], make_pair(pos, val));
    return;
  }
  int tm = (tl + tr) / 2;
  if (pos <= tm)
    modify(v + v, tl, tm, pos, val);
  else
    modify(v + v + 1, tm + 1, tr, pos, val);
  t[v] = combine(t[v + v], t[v + v + 1]);
}
pair<int, long long> query(int v, int tl, int tr, int l, int r) {
  if (r < l) return make_pair(-1, -INF);
  if (l == tl && r == tr) {
    return t[v];
  }
  int tm = (tl + tr) / 2;
  if (r <= tm) return query(v + v, tl, tm, l, r);
  if (l >= tm + 1) return query(v + v + 1, tm + 1, tr, l, r);
  return combine(query(v + v, tl, tm, l, tm),
                 query(v + v + 1, tm + 1, tr, tm + 1, r));
}
int main() {
  ios::sync_with_stdio(false);
  int n, d;
  int nd;
  static long long h[NMAX];
  static long long buf[NMAX];
  int i, j;
  cin >> n >> d;
  for (i = 1; i <= n; i++) {
    cin >> h[i];
    buf[i] = h[i];
  }
  sort(buf + 1, buf + n + 1);
  nd = unique(buf + 1, buf + n + 1) - (buf + 1);
  static int from[NMAX] = {0};
  static int dp[NMAX] = {0};
  pair<int, long long> x, y;
  int l, r;
  for (i = 1; i <= n; i++) {
    l = upper_bound(buf + 1, buf + nd + 1, h[i] - d) - (buf + 1);
    r = lower_bound(buf + 1, buf + nd + 1, h[i] + d) - buf;
    x = query(1, 1, nd, 1, l);
    y = query(1, 1, nd, r, nd);
    if (-1 == x.first) x = y;
    if (-1 == x.first) {
      dp[i] = 1;
      from[i] = 0;
    } else {
      if (y.first != -1 && y.second > x.second) {
        swap(x, y);
      }
      dp[i] = x.second + 1;
      from[i] = x.first;
    }
    l = lower_bound(buf + 1, buf + nd + 1, h[i]) - buf;
    modify(1, 1, nd, l, dp[i]);
  }
  int mx = 1;
  for (i = 1; i <= n; i++) {
    if (dp[mx] < dp[i]) mx = i;
  }
  cout << dp[mx] << endl;
  stack<int> ans;
  j = mx;
  for (i = mx - 1; i > 0; i--) {
    if (h[i] == buf[from[j]]) {
      ans.push(i);
      j = i;
    }
  }
  while (!ans.empty()) {
    cout << ans.top() << " ";
    ans.pop();
  }
  cout << mx << endl;
  return 0;
}
