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

using namespace std;

int main()
{
   list<int> eredm;

   int ic,ik,telepules_szam, telephely_index, minimalis_tav;

   /**/

   cin >> telepules_szam;
   cin >> telephely_index;
   cin >> minimalis_tav;

   int tavok[telepules_szam];

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

   /*/
   telepules_szam = 6;
   telephely_index = 4;
   minimalis_tav = 100;
   int tavok[6] = {0, 70, 110, 210, 230, 500};
   /**/

   telephely_index --; // 0 tol indexelunk!
   ic = telephely_index;
   ik = telephely_index-1;
   eredm.push_front(ic);
   while(ik>=0) {
      if ((tavok[ic]-tavok[ik])>= minimalis_tav) {
         eredm.push_front(ik);
         ic = ik;
      }
      ik--;
   }
   ic = telephely_index;
   ik = telephely_index+1;
   while(ik<telepules_szam) {
      if ((tavok[ik]-tavok[ic])>= minimalis_tav) {
         eredm.push_back(ik);
         ic = ik;
      }
      ik++;
   }
   cout << eredm.size() << endl;
   for ( int n : eredm)
      cout << n + 1 << " ";
   return 0;
}