#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

int main() {
	cin.sync_with_stdio(false);
	cin.tie(nullptr);

	int N, S, T;
	cin >> N >> S >> T;
	vector<int> distanceS(N);
	for (auto &e : distanceS) {
		cin >> e;
	}
	vector<int> answerS{ S - 1 };
	int last = distanceS[S - 1];
	for (int i = S - 2; i >= 0; i--) {
		if (last - distanceS[i] >= T) {
			answerS.push_back(i);
			last = distanceS[i];
		}
	}
	last = distanceS[S - 1];
	for (int i = S; i < N; i++) {
		if (distanceS[i] - last >= T) {
			answerS.push_back(i);
			last = distanceS[i];
		}
	}
	sort(answerS.begin(), answerS.end());
	cout << answerS.size() << '\n';
	for (auto e : answerS) {
		cout << e + 1 << " ";
	}
	cout << '\n';
}