#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define endl "\n"
#define pll pair<ll,ll>
#define vll vector<ll>
#define mll map<ll,ll>
#define fs first
#define sc second

const ll MOD = 1e9+7;

void solve()
{
	ll n, s, t;
	cin >> n >> s >> t;
	vector<ll> v(n);
	vector<ll> ans;
	for(ll i = 0; i < n; i++)
		cin >> v[i];
	ans.push_back(s-1);
	ll last_pos = s-1;
	for(ll i = s-1; i < n; i++)
	{
		if(last_pos != -1)
		{
			if(v[last_pos] + t <= v[i])
			{
				ans.push_back(i);
				last_pos = i;
			}
		}
	}
	last_pos = s-1;
	for(ll i = s-1; i >= 0; i--)
	{
		if(last_pos != -1)
		{
			if(v[last_pos] - t >= v[i])
			{
				ans.push_back(i);
				last_pos = i;
			}
		}
	}

	sort(ans.begin(), ans.end());
	cout << ans.size() << endl;
	for(ll i : ans)
		cout << i+1 << " ";
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);
    ll t = 1;
    //cin >> t;
    while(t--)
        solve();
    return 0;
}