#include <iostream>
#include <set>
using namespace std;

int main()
{
    int n,s,t,a[100001]={0};
    set <int> e;
    cin>>n>>s>>t;
    for (int i = 1; i <= n; i++) cin>>a[i];
    int p=s,kiv=a[p];
    e.insert(p);
    while (p>0)
    {
        if(a[p]<=kiv-t)
        {
            e.insert(p); kiv=a[p];
        }
        p--;
    }
    p=s; kiv=a[p];
    while(p<=n)
    {
        if(a[p]>=kiv+t)
        {
            e.insert(p); kiv=a[p];
        }
        p++;
    }
    cout<<e.size()<<endl;
    set<int>::iterator i;
    for(i=e.begin();i!=e.end();i++) cout<<*i<<" ";
    return 0;
}