ll@n,@s,@p[n],q[],z[],a=0;
rep(i,n)q[i]=p[i];
sortA(n,q);
rep(i,n){
	ll c=bsearch_min[ll,j,0,n](p[i]<=q[j]);
	if((c+1==n||q[c+1]-p[i]>s)&&(c-1<0||p[i]-q[c-1]>s)){
		z[a++]=i+1;
	}
}
wt(a);
wt(z(a));