#include <iostream>
#include <vector> 
#include <deque>

#define ll long long 

using namespace std;

ll n, m, k, i, j,last;

int main()
{
    cin >> n >> m >> k;
    vector <ll> x(n + 1);
    for (i = 1; i <= n; ++i) cin >> x[i];

   
    deque <ll> res;
    res.push_back(m);
    for (i = m-1; i >= 1; --i)
    {
        if (x[res[0]] - x[i] >= k) res.push_front(i);
    }

    for (i = m + 1; i <= n; ++i)
    {
        if (x[i] - x[res.back()] >= k) res.push_back(i);
    }
    cout << res.size() << "\n";
    for (auto& e : res) cout << e << " ";
}