#include using namespace std; using ll=long long; vector v; struct node { int x; int y; } a[200001]; bool cmp(node &a,node &b) { return a.x>n>>s; for(int i=1;i<=n;++i) { cin>>a[i].x; a[i].y=i; } sort(a+1,a+1+n,cmp); int m=a[1].x; for(int i=2;i<=n;++i) { if(a[i].x-m>s) v.push_back(a[i].y); m=a[i].y; } cout<