#include <bits/stdc++.h>
using namespace std;
vector<int> nums;
vector<int> v;
int n,x,k; 

void solve(int a, int b) {
    if(b == 0) {
        int dist = 0;
        for(int i = a+1; i < n; i++) {
            dist += nums[i]-nums[i-1];
            if(dist >= k) {
                v.push_back(i);
                solve(i,0);
                break;
            }
        }
    }
    else {
        int dist = 0;
        for(int i = a-1; i >= 0; i--) {
            dist += nums[i+1] - nums[i];
            if(dist >= k) {
                v.push_back(i);
                solve(i, 1);
                break;
            }
        }
    }
}

int main() {
    cin >> n >> x >> k;
    x--;
    nums.assign(n,0);
    for(int i = 0; i < n; i++) cin >> nums[i];
    v.push_back(x);
    solve(x,0);
    solve(x,1);
    sort(begin(v), end(v));
    cout << v.size() << endl;
    for(int i : v) cout << i+1 << " ";
}