import std.stdio, std.conv, std.string, std.algorithm, std.math, std.array, std.container;

int n, k, c;
bool[] banned;

bool workable(int banned_day) {
  int k_tmp = k;
  for(int i=0; i<n; ) {
    if(!banned[i] && i!=banned_day) {
      i += c+1;
      k_tmp--;
      if(k_tmp == 0) return true;
    }
    else i++;
  }
  return false;
}

bool[] solve() {
  scanf("%d %d %d\n", &n, &k, &c);
  string s = readln.chomp;
  banned = s.map!(c => c=='x').array;
  banned = banned.dup;
  bool[] result = new bool[n];
  if(!workable(-1)) return result;
  for(int i=0; i<n; i++) {
    if(banned[i]) result[i] = false;
    else {
      if(workable(i)) {
        result[i] = false;
      }
      else {
        result[i] = true;
      }
    }
  }
  return result;
}

void main() {
  auto res = solve();
  for(int i=0; i<res.length; i++) {
    if(res[i]) writeln(i+1);
  }
}

