#ifndef DEBUG
#  define NDEBUG
#endif
#include <iostream>
#include <algorithm>
#include <string>
#include <iterator>
#include <utility>
#include <type_traits>
#include <limits>
#include <cassert>
#include <numeric>
#include <vector>
#include <map>

using namespace std;

// template {{{
// misc {{{
using Z = long long;
[[maybe_unused]]
constexpr Z INF = numeric_limits<Z>::max() / 3;
// }}}

// debug {{{
template <class T>
using enable_if_sequence_t = enable_if_t<
  is_same<
    typename iterator_traits<
      typename remove_cv_t<remove_reference_t<T>>::iterator
    >::iterator_category,
    random_access_iterator_tag>{}>;
#ifdef NDEBUG
# define dump(x)
# define debug if (0)
template <class T>
inline T&& ix(T&& value) { return value; }
template <class T, class Index, class... Indices, class = enable_if_sequence_t<T>>
inline auto&& ix(T&& container, Index index, Indices... indices) {
  return ix(container[index], indices...);
}
#else
# define dump(x) do { \
    cerr << "\e[33m[dump: " << __LINE__ << "] " << (#x) << " = " << x << "\e[0m" << endl; \
  } while (0);
# define debug
template <class T>
inline auto&& ix_impl([[maybe_unused]] int line, [[maybe_unused]] const char* code, T&& value) {
  return value;
}
template <class T, class Index, class... Indices, class = enable_if_sequence_t<T>>
inline auto&& ix_impl(int line, const char* code, T&& container, Index index, Indices... indices) {
  if (index < 0) {
    cerr << "\e[31mix: negative index at line " << line << ", ix(" << code << ")\e[0m" << endl;
    exit(1);
  }
  int size = container.size();
  if (index >= size) {
    cerr << "\e[31mix: index out of range at line " << line << ", ix(" << code << ")\n"
      << "index = " << index << " whereas size = " << size << "\e[0m" << endl;
    exit(1);
  }
  return ix_impl(line, code, container[index], indices...);
}
#define ix(...) ix_impl(__LINE__, #__VA_ARGS__, __VA_ARGS__)
#endif
// }}}

// IO {{{
template <class T, class U>
ostream& operator<< (ostream& os, pair<T, U> p) {
  os << '(' << p.first << ", " << p.second << ')';
  return os;
}
template <class T, class U>
istream& operator>> (istream& is, pair<T, U>& p) {
  is >> p.first >> p.second;
  return is;
}
template <class T>
false_type is_container_impl(...);
template <class T, class = typename T::iterator>
true_type is_container_impl(T);
template <class T>
struct is_container : decltype(is_container_impl<T>(declval<T>())) {};
template <>
struct is_container <string> : std::false_type {};
template <class Container, class = enable_if_t<is_container<Container>{}>>
istream& operator>> (istream& is, Container& cont) {
  for (auto& v : cont) is >> v;
  return is;
}
template <class Container, class = enable_if_t<is_container<Container>{}>>
ostream& operator<< (ostream& os, Container const& cont) {
  bool first = true;
  constexpr char sep =
    is_container<typename Container::value_type>{} ? '\n' : ' ';
  for (auto const& v : cont) {
    if (!first) {
      os << sep;
    }
    first = false;
    os << v;
  }
  return os;
}
// }}}
// }}}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.precision(10);
  cout << fixed;
  Z N, K, C;
  string S;
  cin >> N >> K >> C >> S;
  vector<Z> oks;
  for (auto i = 0; i < N; i++)
    if (ix(S, i) == 'o')
      oks.push_back(i);
  Z W = oks.size();
  if (W == 1) {
    cout << oks.front() + 1 << endl;
    return 0;
  }
  oks.push_back(INF);
  vector<Z> dpl(W + 1), dpr(W + 1);
  for (auto i = 0; i < W; i++) {
    ix(dpl, i + 1) = max(ix(dpl, i + 1), ix(dpl, i));
    auto next = upper_bound(begin(oks), end(oks), ix(oks, i) + C);
    Z n = next - begin(oks);
    ix(dpl, n) = max(ix(dpl, n), ix(dpl, i) + 1);
  }
  for (auto i = W; i > 0; i--) {
    ix(dpr, i - 1) = max(ix(dpr, i - 1), ix(dpr, i));
    Z p;
    if (ix(oks, i - 1) <= C) {
      p = 0;
    }
    else {
      auto prev = partition_point(begin(oks), end(oks),
          [&] (Z k) { return k < ix(oks, i - 1) - C; });
      prev--;
      p = prev - begin(oks) + 1;
    }
    ix(dpr, p) = max(ix(dpr, p), ix(dpr, i) + 1);
  }
  dump(dpl);
  dump(dpr);
  for (auto i = 0; i < W; i++) {
    dump(i);
    Z workdays = 0;
    Z last_work = -1;
    if (i > 0) {
      auto left = lower_bound(begin(dpl), end(dpl), ix(dpl, i - 1));
      last_work = left - begin(dpl);
      workdays += ix(dpl, last_work) + 1;
    }
    dump(workdays);
    if (i < W - 1) {
      auto right = upper_bound(begin(oks) + i + 1, end(oks), (last_work >= 0 ? ix(oks, last_work) : -INF) + C);
      Z next_work = right - begin(oks);
      workdays += ix(dpr, next_work + 1) + 1;
    }
    dump(workdays);
    if (workdays < K)
      cout << ix(oks, i) + 1 << endl;
  }
}



Measured memory_bytes: 6536