#include <iostream>
#include <vector>
#include <deque>
using namespace std;

int main()
{
	int n, s, t;
	int e;
	cin >> n >> s >> t;
	vector<int>loc(n);
	deque<int>megold;
	for (int i = 0; i < n; ++i)
	{
		cin >> loc[i];
	}
	e = loc[s - 1]; 
	megold.push_back(s);
	for (int i = s; i < n; ++i)
	{
		if (loc[i] - e >= t)
		{
			megold.push_back(i + 1);
			e = loc[i];
		}
	}
	e = loc[s - 1];
	for (int i = s - 2; i >= 0; --i)
	{
		if (e - loc[i] >= t)
		{
			megold.push_front(i + 1);
			e = loc[i];
		}
	}
	cout << megold.size()<<endl;
	for (int i = 0; i < megold.size(); ++i) cout << megold[i] <<" ";
}