#include <algorithm>
#include <iostream>
#include <list>

using namespace std;

int main()
{
   ios_base::sync_with_stdio(false);
   cin.tie(NULL);

   list<int> eredm;

   int i,telepules_szam, telephely_index, minimalis_tav,pos;

   cin >> telepules_szam >> telephely_index >> minimalis_tav;

   int tavok[telepules_szam];

   for (i=0;i<telepules_szam;i++) {
      cin >> tavok[i];
   }

   eredm.push_front(telephely_index);
   telephely_index --; // 0 tol indexelunk!
   pos = tavok[telephely_index];
   i = telephely_index-1;
   while(i>=0) {
      if ((pos-tavok[i]) >= minimalis_tav) {
         eredm.push_front(i+1);
         pos = tavok[i];
      }
      i--;
   }
   pos = tavok[telephely_index];
   i = telephely_index+1;
   while(i<telepules_szam) {
      if ((tavok[i]-pos) >= minimalis_tav) {
         eredm.push_back(i+1);
         pos = tavok[i];
      }
      i++;
   }
/*/
   cout << eredm.size() << endl;
   for ( int n : eredm)
      cout << n + 1 << " ";
/*/
   cout << eredm.size() << endl;
   for_each(eredm.begin(), eredm.end(), [](const int n) { cout << n << ' '; });
/**/
   return 0;
}