#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
vector<int> meg;
int main(){
    int n,m,t; cin>>n>>m>>t;
    vector <long long> x(n+1);
    for (int i=1;i<=n;++i){
        cin>>x[i];
    }
    vector<long long> stat(n+1,0);
    meg.push_back(m);
    int tav=0;
    for (int i=m+1;i<=n;++i){
        stat[i]=x[i]-x[i-1];
        if (stat[i]+tav>=t || stat[i]==0) 
        {
            meg.push_back(i);
            tav=0;
        }
        else if (stat[i]+tav<t) tav+=stat[i];
    }
    tav=0;
    for (int i=m-1;i>=1;--i){
        stat[i]=abs(x[i]-x[i+1]);
        if (stat[i]+tav>=t || stat[i]==0) {
            meg.push_back(i);
            tav=0;
        }
        else if (stat[i]+tav<t) tav+=stat[i];
    }
    sort(meg.begin(), meg.end());
    cout<<meg.size()<<"\n";
    for (auto e:meg) cout<<e<<" ";
    return 0;
}