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

using namespace std;

deque<int>v;
vector<int>telepules;
vector<int>helyek;

int i,n,s,t,db=1;

int main()
{
    cin>>n>>s>>t;
    telepules.resize(n+1);
    for(i=1;i<=n;++i) cin>>telepules[i];

    v.push_back(telepules[s]);
    for(i=s-1;i>=1;--i)
    {
        if(v[0]-telepules[i]>=t){
            v.push_back(telepules[i]);
            helyek.push_back(i);
            v.pop_front();
            ++db;
        }
    }
    v.pop_front();
    v.push_back(telepules[s]);
    helyek.push_back(s);
    for(i=s+1;i<=n;++i)
    {
        if(telepules[i]-v[0]>=t){
            v.push_back(telepules[i]);
            helyek.push_back(i);
            v.pop_front();
            ++db;
        }
    }
    sort(helyek.begin(),helyek.end());

    cout<<db<<"\n";
    for (auto &e:helyek) cout<<e<<" ";
    return 0;
}