#include <iostream>
#include <queue>
#include <set>
#define ll long long

using namespace std;

int main()
{
    ll n, p, t;
    cin >> n >> p >> t;
    vector <ll> x(n + 1);
    set <ll> poz;
    for (ll i = 1; i <= n; ++i)
    {
        cin >> x[i];
    }
    poz.insert(p);
    ll a = x[p], db = 1;
    for (ll i = p - 1; i >= 1; --i)
    {
        if (a - x[i] >= t)
        {
            a = x[i];
            poz.insert(i);
            ++db;
        }
    }
    a = x[p];
    for (ll i = p + 1; i <= n; ++i)
    {
        if (x[i] - a >= t)
        {
            a = x[i];
            poz.insert(i);
            ++db;
        }
    }
    cout << db << "\n";
    for (auto& e : poz)
        cout << e << " ";

    return 0;
}
/*
6 4 100
0 70 110 210 230 500
*/