#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007;
// const int MOD = 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
const int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
  }
} iosetup;

template <typename Monoid>
struct RMQ {
  RMQ(int sz, const Monoid UNITY) : UNITY(UNITY) {
    init(sz);
    dat.assign((n << 1) - 1, UNITY);
  }

  RMQ(const vector<Monoid> &a, const Monoid UNITY) : UNITY(UNITY) {
    int a_sz = a.size();
    init(a_sz);
    dat.resize((n << 1) - 1);
    REP(i, a_sz) dat[n - 1 + i] = a[i];
    for (int i = n - 2; i >= 0; --i) dat[i] = max(dat[(i << 1) + 1], dat[(i << 1) + 2]);
  }

  void update(int node, Monoid val) {
    node += n - 1;
    dat[node] = val;
    while (node > 0) {
      node = (node - 1) >> 1;
      dat[node] = max(dat[(node << 1) + 1], dat[(node << 1) + 2]);
    }
  }

  Monoid query(int a, int b) { return query(a, b, 0, 0, n); }

  int find(int a, int b, Monoid val) { return find(a, b, val, 0, 0, n); }

  Monoid operator[](const int idx) const { return dat[idx + n - 1]; }

private:
  int n = 1;
  const Monoid UNITY;
  vector<Monoid> dat;

  void init(int sz) { while (n < sz) n <<= 1; }

  Monoid query(int a, int b, int node, int left, int right) {
    if (right <= a || b <= left) return UNITY;
    if (a <= left && right <= b) return dat[node];
    return max(query(a, b, (node << 1) + 1, left, (left + right) >> 1), query(a, b, (node << 1) + 2, (left + right) >> 1, right));
  }

  int find(int a, int b, Monoid val, int node, int left, int right) {
    if (dat[node] < val || right <= a || b <= left) return -1;
    if (right - left == 1) return node - (n - 1);
    int res_l = find(a, b, val, (node << 1) + 1, left, (left + right) >> 1);
    if (res_l != -1) return res_l;
    return find(a, b, val, (node << 1) + 2, (left + right) >> 1, right);
  }
};

int main() {
  int n, k, c; string s; cin >> n >> k >> c >> s;
  if (c == 0) {
    if (count(ALL(s), 'o') == k) {
      REP(i, n) {
        if (s[i] == 'o') cout << i + 1 << '\n';
      }
    }
    return 0;
  }
  RMQ<int> dpl(n, -INF), dpr(n, -INF);
  REP(i, n) {
    if (s[i] == 'o') dpl.update(i, max(dpl.query(0, i - c), 0) + 1);
  }
  // REP(i, n) cout << dpl[i] << " \n"[i + 1 == n];
  for (int i = n - 1; i >= 0; --i) {
    if (s[i] == 'o') dpr.update(i, max(dpr.query(i + c + 1, n), 0) + 1);
  }
  // REP(i, n) cout << dpr[i] << " \n"[i + 1 == n];
  RMQ<int> rmq(n, -INF);
  REP(i, n) {
    if (i == 0) {
      rmq.update(i, dpr.query(i + 1, n));
    } else {
      rmq.update(i, max(dpl.query(0, i), 0) + max(dpr.query(i + c, n), 0));
    }
  }
  // REP(i, n) cout << rmq[i] << " \n"[i + 1 == n];
  REP(i, n) {
    // cout << rmq.query(max(i - c + 1, 0), i + 1) << '\n';
    if (s[i] == 'o' && rmq.query(max(i - c + 1, 0), i + 1) < k) cout << i + 1 << '\n';
  }
  return 0;
}


Measured memory_bytes: 6804