#include <bits/stdc++.h>
using namespace std;
using ll=long long; 
int main() {
	int n,k,s;
	cin>>n>>k>>s;
	vector<ll> tav={-50000001};
	for (int i=0; i<n;i++){
		ll c;
		cin>>c;
		tav.push_back(c);
	}
	vector<int> ans={k}; 
	int mst=tav[k];
	for (int i=k-1;i>0;i--){
		if (tav[i]+s<=mst){
			mst=tav[i];
			ans.push_back(i);
		}
	}
	mst=tav[k];
	for (int i=k+1; i<=n;i++){
		if (tav[i]-s>=mst){
			mst=tav[i];
			ans.push_back(i);
		}
	}
	sort(ans.begin(), ans.end());
	cout<<ans.size()<<endl;
	for (int x:ans) cout<<x<<" "; 
}