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

int main()
{
    int n,h,dist;
    cin>>n>>h>>dist;
    vector<int>  p(n+1);
    for(int i=1;i<=n;i++)
        {
        cin>>p[i];
        }
    int l,r;
    vector<int> ans;
    l=r=h+1;
    l--;
    ans.push_back(h);
    while(r<=n)
        {
        if(p[r]-p[l]>=dist)
            {
            l=r;
            ans.push_back(r);
            }
        r++;
        }
    r=l=h-1;
    r++;
    while(l>0)
        {
        if(p[r]-p[l]>=dist)
            {
            r=l;
            ans.push_back(l);
            }
        l--;
        }
    sort(ans.begin(),ans.end());
    cout<<ans.size()<<endl;
    for(auto x : ans)
        {
        cout<<x<<" ";
        }
    return 0;
}