#include <bits/stdc++.h>
template<typename T>
struct Edge {
    int from, to;
    T cost;
    Edge(int from, int to, T cost) {
        this->from = from;
        this->to = to;
        this->cost = cost;
    }
};
bool operator == (Edge<int> e1, Edge<int> e2) {
    return e1.from == e2.from &&
            e1.to == e2.to &&
            e1.cost == e2.cost;
}
bool operator < (Edge<int> e1, Edge<int> e2) {
    return e1.cost > e2.cost;
}
template<typename T>
using Edges = std::vector<Edge<T>>;
template<typename T>
using Graph = std::vector<Edges<T>>;
template <typename T>
std::vector<T> dijkstra(const Graph<T> &g, int s) {
    int sz = (int)(g.size());
    std::vector<T> dist(sz, -1);
    std::priority_queue<std::pair<T, int>, std::vector<std::pair<T, int>>, std::greater<std::pair<T, int>>> pq;
    dist[s] = 0;
    pq.push({0, s});
    while(!pq.empty()) {
        T d = pq.top().first;
        int now = pq.top().second;
        pq.pop();
        if(dist[now] == -1 || d > dist[now]) continue;
        for(int i=0;i<(int)(g[now].size());++i) {
            int next = g[now][i].to;
            T cost = g[now][i].cost;
            if(dist[next] == -1 || dist[next] > dist[now] + cost) {
                dist[next] = dist[now] + cost;
                pq.push({cost, next});
            }
        }
    }
    return dist;
}
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
const ld eps = 1e-9;
const ll MOD = 1000000007;
const int INF = 1000000000;
const ll LINF = 1ll<<50;
template<typename T>
void printv(const vector<T>& s) {
  for(int i=0;i<(int)(s.size());++i) {
    cout << s[i];
    if(i == (int)(s.size())-1) cout << endl;
    else cout << " ";
  }
}
template<typename T1, typename T2>
ostream& operator<<(ostream &os, const pair<T1, T2> p) {
  os << p.first << ":" << p.second;
  return os;
}
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(10);
  int n, k, c; cin >> n >> k >> c;
  string s; cin >> s;
  vector<int> v;
  vector<int> tmp;
  int now = 0;
  map<int, int> mp;
  for(int i=0;i<(int)(s.size());++i) {
    if(s[i] == 'o') {
      v.push_back(i);
      mp[i] = (int)(v.size())-1;
      if(now <= i) {
        tmp.push_back(i);
        now = i+c+1;
      }
    }
  }
  int sz = (int)(v.size());
  Graph<ll> g(sz+1);
  Graph<ll> revg(sz+1);
  queue<int> que;
  for(int i=0;i<sz;++i) {
    while(!que.empty() && v[i] - v[que.front()] > c) {
      g[que.front()].push_back(Edge<ll>(que.front(), i, 1));
      revg[i].push_back(Edge<ll>(i, que.front(), 1));
      que.pop();
    }
    que.push(i);
  }
  while(!que.empty()) {
    g[que.front()].push_back(Edge<ll>(que.front(), sz, 1));
    revg[sz].push_back(Edge<ll>(sz, que.front(), 1));
    que.pop();
  }
  auto d = dijkstra(g, 0);
  auto revd = dijkstra(revg, sz);
  vector<int> dp(sz+1);
  dp[sz] = 0;
  for(int i=sz-1;i>=0;--i) {
    for(int j=0;j<(int)(g[i].size());++j) {
      int nxt = g[i][j].to;
      dp[i] = max(dp[i], dp[nxt]+1);
    }
    dp[i] = max(dp[i], dp[i+1]);
  }
  int cnt = 0;
  vector<int> ans;
  for(int i=0;i<(int)(tmp.size());++i) {
    if(cnt + dp[mp[tmp[i]]+1] < k) ans.push_back(tmp[i]);
    cnt++;
  }
  for(int i=0;i<(int)(ans.size());++i) {
    cout << ans[i]+1 << endl;
  }
}


Measured memory_bytes: 39428