#include <bits/stdc++.h>

using namespace std;

int n, telh, tav;
vector<int> kapcs;
vector<int> varos;



int main()
{
    iostream::sync_with_stdio(0);
    cin.tie(0);
    cin >> n >> telh >> tav;
    kapcs.assign(n, 100001);
    int ertek;
    int counter = 0;
    for(int i = 0; i < n; i++)
    {
        cin >> ertek;
        varos.push_back(ertek);
    }
    set<int> varosok;
    int current = telh-1;
    for(int i = telh-2; i >= 0; i--)
    {
        if(varos[current] - varos[i] >= tav)
        {
            varosok.insert(i+1);
            counter++;
            current = i;
        }
    }
    current = telh-1;
    for(int i = telh; i < varos.size(); i++)
    {
        if(varos[i] - varos[current] >= tav)
        {
            varosok.insert(i+1);
            counter++;
            current = i;
        }
    }
        varosok.insert(telh);
        cout << varosok.size() << "\n";
        for(set<int>::iterator itr = varosok.begin(); itr != varosok.end(); ++itr)
        {
            cout << *itr << " ";
        }
}