#include<bits/stdc++.h>
using namespace std;

int n,s,t;
int main(){
     cin >> n >> s >> t;
     vector<int> a(n+1);
     for(int i = 1; i <= n; i++){
        cin >> a[i];
     }
     int dp[n+1]={0}, pr[n+1];
     //dp[s]=1;
     int li=s;
     int si2,m2=0;

     for(int i = s+1; i <= n; i++){
        while(li+1 < i){
            if(a[i]-a[li+1] >= t){
                li++;
                continue;
            }
            break;
        }
        if(a[i]-a[s] < t) continue;

        dp[i]=dp[li]+1;
        pr[i] = li;
        if(a[li]-a[s] < t){
            dp[i]=dp[s]+1;
            pr[i]=s;
        }
        if(dp[i] > m2){
            m2 = dp[i];
            si2 = i;
        }
     }
     li=s;
     int si,m=0;
     for(int i = s-1; i > 0; i--){
        while(li-1 > i){
            if(a[li-1]-a[i] >= t){
                li--;
                continue;
            }
            break;
        }
        if(a[s]-a[i] < t) continue;
        //cout << li << " " << i << endl;
        dp[i]=dp[li]+1;
        pr[i]=li;
        if(a[s]-a[li] < t){
            dp[i]=dp[s]+1;
            pr[i]=s;
        }
        if(dp[i] > m){
            m = dp[i];
            si = i;
        }

     }
    cout << m+m2+1<<endl;
    int c=si;
    vector<int> ans;
    while(c != s){
        ans.push_back(c);
        c = pr[c];
    }
    c = si2;
    while(c != s){
        ans.push_back(c);
        c = pr[c];
    }
    ans.push_back(s);
    sort(ans.begin(), ans.end());
    for(int i:ans){
        cout << i << " ";
    }
}