#include<stdio.h>
#define N_MAX 200000


int step1(long num,char s[],long k,long Hako[],long c,long n){
  long m=0,p=0,b=0;
  char hosyu=s[num];
  s[num]='x';
  while(m<=k+1){
    if(m==k+1)b=2;
    else if(m==k)if(p>n-1)b=1;
    if(p>n-1){
        break;
      }
    else if(s[p]=='o'){
      Hako[m]=p;
        p+=c+1;
        m++;
      }
    else if(s[p]=='x'){
        p++;
      };
    //printf("%ldを検査\n",num+1);
  };
  s[num]=hosyu;
  return b;
};


void step2(long num,char s[],long k,long c,long n){
  long m=0,p=0;
  char hosyu=s[num];
  s[num]='x';
  while(m<k){
    if(p>n-1){
        printf("%ld\n",num+1);
        break;
      }
    while(s[p]=='x')p++;
    if(p>n-1){
      m++;
      p+=c+1;
    };    
  };
  s[num]=hosyu;
};

int main(){
  int l=0;
  long N,K,C,p=0;
  long hako[N_MAX]={};
  char S[N_MAX]={};
  scanf("%ld %ld %ld",&N,&K,&C);
  scanf("%s",S);
  do{l=step1(p,S,K,hako,C,N);
     p++;
    }while(l==0);
  if(l!=2)for(l=0;l<K;l++)step2(hako[l],S,K,C,N);
};
