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:60777216")
using namespace std;
inline string sbstr(string s, int i, int j) { return s.substr(i, j - i + 1); }
const double EPS = 1e-9;
const int IINF = 1000000000;
const double PI = acos(-1.0);
const long long LINF = 6000000000000000000LL;
int a[100000 + 7];
int p[100000 + 7];
struct Node {
  Node* left;
  Node* right;
  int val;
  Node(long long v = -1, Node* l = NULL, Node* r = NULL)
      : left(l), right(r), val(v) {}
};
Node* root;
long long n = 1000000000000000LL;
void update(Node* v, long long l, long long r, long long pos, int delta) {
  if (l > r) {
    cerr << "fucking shit " << endl;
    return;
  }
  if (l == r) {
    if (v == NULL) {
      v = new Node();
    }
    if (v->val == -1) {
      v->val = delta;
    } else {
      if (a[v->val] < a[delta]) {
        v->val = delta;
      }
    }
  } else {
    if (v == NULL) {
      v = new Node();
    }
    long long mid = (l + r) / 2LL;
    if (pos <= mid) {
      if (v->left == NULL) v->left = new Node();
      update(v->left, l, mid, pos, delta);
      if (v->val == -1) {
        v->val = v->left->val;
      } else if (a[v->val] < a[v->left->val]) {
        v->val = v->left->val;
      }
    } else {
      if (v->right == NULL) v->right = new Node();
      update(v->right, mid + 1, r, pos, delta);
      if (v->val == -1) {
        v->val = v->right->val;
      } else if (a[v->val] < a[v->right->val]) {
        v->val = v->right->val;
      }
    }
  }
}
int get_max(Node* v, long long tl, long long tr, long long l, long long r) {
  if (l > r) {
    return -1;
  }
  if (tl == l && tr == r) {
    if (v == NULL) {
      return -1;
    }
    return v->val;
  } else {
    int ans = -1;
    long long mid = (tl + tr) / 2LL;
    if (v->left != NULL) {
      int delta1 = get_max(v->left, tl, mid, l, min(r, mid));
      if (delta1 != -1) {
        ans = delta1;
      }
    }
    if (v->right != NULL) {
      int delta2 = get_max(v->right, mid + 1, tr, max(mid + 1, l), r);
      if (delta2 != -1 && ans != -1 && a[delta2] > a[ans]) {
        ans = delta2;
      } else if (delta2 != -1 && ans == -1) {
        ans = delta2;
      }
    }
    return ans;
  }
}
int main() {
  root = new Node();
  int k, d, ans = -1;
  scanf("%d%d", &k, &d);
  for (int i = 0; i < k; ++i) {
    long long x;
    scanf("%lld", &x);
    if (i == 0) {
      a[i] = 1;
      p[i] = -1;
    } else {
      int mmax1 = get_max(root, 0, n, 0, x - d);
      int mmax2 = get_max(root, 0, n, x + d, n);
      if (mmax1 == -1 && mmax2 == -1) {
        a[i] = 1;
        p[i] = -1;
      } else if (mmax1 != -1 && mmax2 == -1) {
        a[i] = a[mmax1] + 1;
        p[i] = mmax1;
      } else if (mmax1 == -1 && mmax2 != -1) {
        a[i] = a[mmax2] + 1;
        p[i] = mmax2;
      } else {
        if (a[mmax1] > a[mmax2]) {
          a[i] = a[mmax1] + 1;
          p[i] = mmax1;
        } else {
          a[i] = a[mmax2] + 1;
          p[i] = mmax2;
        }
      }
    }
    update(root, 0, n, x, i);
  }
  for (int i = 0; i < k; ++i) {
    if (ans == -1 || a[ans] < a[i]) {
      ans = i;
    }
  }
  printf("%d\n", a[ans]);
  vector<long long> path;
  while (ans != -1) {
    path.push_back(ans + 1);
    ans = p[ans];
  }
  reverse(path.begin(), path.end());
  for (int i = 0; i < path.size(); ++i) {
    printf("%lld ", path[i]);
  }
  puts("");
  return 0;
}
