#include <iostream>
#include <vector>
#include <map>
#include <deque>
using namespace std;
#define ll long long

ostream& operator<<(ostream& os, vector<int>& input)
{
    for (auto i : input)
    {
        os << i << " ";
    }
    return os;
}

int main()
{
    cin.tie(nullptr);
    cout.tie(nullptr);
    ios_base::sync_with_stdio(false);
    int n, s, t;
    cin >> n >> s >> t;
    vector<int>vec(n);
    deque<int>m;
    for (size_t i = 0; i < n; i++) cin >> vec[i];
    int a = vec[s - 1];
    m.push_back(s);
    for (int i = s-1; i >= 0; i--)
    {
        if (i>=0 && a - t >= vec[i])
        {
            a = vec[i];
            m.push_front(i + 1);
        }
    }
    a = vec[s - 1];
    for (size_t i = s; i < n; i++)
    {
        if (a + t <= vec[i])
        {
            a = vec[i];
            m.push_back(i + 1);
        }
    }
    cout << m.size() << endl;
    while (!m.empty())
    {
        cout << m.front() << " ";
        m.pop_front();
    }
    cout << endl;
    return 0;
}
/*
6 4 100
0 70 110 210 230 500
*/