#include <iostream>
#include <queue>
#define ll long long

using namespace std;

//ifstream cin("t.in");
//ofstream cout("t.out");

vector <ll>x;
deque <ll>mg;

ll n,m,t,a,akt,i,db;

int main()
{
    cin>>n>>m>>t;
    for(i=0;i<n;++i)
    {
        cin>>a;
        x.push_back(a);
    }

    akt=x[m-1];
    mg.push_back(m);
    db=1;

    for(i=m;i<n;++i)
    {
        if(x[i]-akt>=t)
        {
            ++db;
            akt=x[i];
            mg.push_back(i+1);
        }
    }
    akt=x[m-1];

    for(i=m-2;i>=0;--i)
    {
        if(akt-x[i]>=t)
        {
            ++db;
            akt=x[i];
            mg.push_front(i+1);
        }
    }

    cout<<db<<"\n";
    for(auto &e:mg) cout<<e<<" ";

    return 0;
}