#include <bits/stdc++.h>

using namespace std;

int main()
{
    //ifstream cin("in.txt");
    int n, k, t;
    cin >> n >> k >> t;

    vector<int> a(n + 1);
    for(int i = 1; i <= n; i++){
        cin >> a[i];
    }
    long long d = 0;
    stack<int> s;
    queue<int> q;
    for(int i = k; i > 1; i--){
        d += a[i]-a[i-1];
        if(d>=t){
            d = 0;
            s.push(i-1);
        }
    }

    d=0;
    for(int i = k; i < n; i++){
        d += a[i+1] - a[i];
        if(d>=t){
            d = 0;
            q.push(i+1);
        }
    }

    cout << s.size() + q.size() + 1 << '\n';
    while(s.size()){
        cout << s.top() << " ";
        s.pop();
    }
    cout << k << " ";
    while(q.size()){
        cout << q.front() << " ";
        q.pop();
    }



    return 0;
}