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

using namespace std;

vector<int> ans;

int main()
{
	int n, s, t; cin >> n >> s >> t;
	vector<long long> v(n + 1);
	vector<long long> x(n + 1);
	for (int i = 1; i <= n; ++i) {
		cin >> v[i];
	}
	
	ans.push_back(s);
	int tav = 0;
	for (int i = s+1; i <= n; ++i) {
		x[i] = v[i] - v[i - 1];
		if (x[i] + tav >= t) {
			ans.push_back(i);
			tav = 0;
		}
		else if (x[i] + tav < t) {
			tav += x[i];
		}
	}

	tav = 0;
	for (int i = s-1; i >= 1; --i) {
		x[i] = v[i + 1] - v[i];
		if (x[i] + tav >= t) {
			ans.push_back(i);
			tav = 0;
		}
		else if (x[i] + tav < t) {
			tav += x[i];
		}
	}
	
	sort(ans.begin(), ans.end());
	cout << ans.size() << "\n";
	for (auto& i : ans) {
		cout << i << " ";
	}
}