#include <iostream>
#include <vector>

using namespace std;

const int NMAX = 100001;
vector<int> ans;
vector<int> adds;

static void GetAns(int index)
{
	if (index == -1)
	{
		return;
	}
	ans.push_back(index + 1);
	GetAns(adds[index]);
}

int main()
{
	int n, m, d;
	cin >> n >> m >> d;

	vector<int> p(n);
	

	for (int i = 0; i < n; i++)
	{
		cin >> p[i];
		adds.push_back(-1);
	}
	m--;
	int comp = p[m];
	vector<int> dp(n, 1);
	dp[0] = 1;
	adds[0] = -1;
	for (int i = 1; i < n; i++)
	{
		int val = p[i];
		if (abs(val - comp) < d && i != m)
		{
			dp[i] = -NMAX;
			p[i] = -1;
			continue;
		}
		int index = i - 1;
		int maxim = -1;
		int s = -1;
		while ((val - p[index] < d || dp[index] <= 0) && index > 0)
		{
			if (maxim < dp[index] + 1 && p[i] != -1)
			{
				maxim = dp[index] + 1;
				s = index;
			}
			index--;
		}
		if (val - p[index] >= d)
		{
			if (maxim <= 0 && dp[index] <= 0)
			{
				dp[i] = 1;
				adds[i] = -1;
			}
			else if (maxim > 1 + dp[index] || p[index] == -1)
			{
				dp[i] = maxim;
				adds[i] = s;
			}
			else
			{
				dp[i] = dp[index] + 1;
				adds[i] = index;
			}
		}
		else
		{
			dp[i] = 1;
			adds[i] = -1;
		}
	}
	cout << dp[n - 1] << endl;
	GetAns(n - 1);
	int size = ans.size();
	for (int i = size - 1; i >= 0; i--)
	{
		cout << ans[i] << " ";
	}
	cout << endl;
}