#include<bits/stdc++.h>
using namespace std;
int main(){
  long N,K,C;cin>>N>>K>>C;
  string S;cin>>S;
  vector<long>L(K,0),R(K,N-1);//i+1個目があり得る左端と右端
  
  long t=0;
  for(long i=0;i<N;i++){
    if(S[i]=='o'){
      L[t]=i;t++;
      i+=C;
    }
    if(t>=K)break;
  }
  t=K-1;
  for(long i=N-1;i>=0;i--){
    if(S[i]=='o'){
      R[t]=i;t--;
      i-=C;
    }
    if(t<0)break;
  }
  for(long i=0;i<K;i++)if(R[i]==L[i])cout<<(R[i]+1L)<<endl;
  
}