#include <iostream>
#include <vector>
#include <fstream>
#include <algorithm>
using namespace std;

int main()
{
    int n, t, s, i, al;
    cin >> n >> s >> t;
    int a[n];
    vector<int>kiir;
    kiir.push_back(s);
    for(i=0; i<n;i++)cin >> a[i];
    al = a[s-1];
    for(i=s; i<n; i++)
    {
        if(a[i]-al>=t)
        {
            kiir.push_back(i+1);
            al = a[i];
        }

    }
    al = a[s-1];
    for(i=s-2; i>=0; i--)
    {
        if(al-a[i]>=t)
        {
            al = a[i];
            kiir.push_back(i+1);
        }
    }
    sort(kiir.begin(), kiir.end());
    cout << kiir.size() << endl;
    for(i=0; i<kiir.size(); i++)cout << kiir[i] << " ";
    return 0;
}