#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp fixed << setprecision
#define pb(x) push_back(x)
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const ll MOD = 1e9+7;
//const ll MOD = 998244353;
const int inf = 1e9;
const ll INF = 1e18;
const ld EPS = 1e-10;
const string alpha = "abcdefghijklmnopqrstuvwxyz";

using T = ll;
const int MAX_V = 1<<19;
//演算の内容
T f(T a, T b){return a+b;}
//何で初期化するか
T other = 0;

struct lazy_segment_tree{
    int n;
    T seg[2*MAX_V], lazy[2*MAX_V];
    //要素数N(0〜N-1)の初期化された遅延セグメント木を構築
    lazy_segment_tree(int N){
        n = 1;
        while(n < N) n *= 2;
        fill_n(seg, 2*n-1, other);
        fill_n(lazy, 2*n-1, other);
    }
    //i番目の要素をxに変更(0番目から数える)
    void update(int i, T x){
        i += n-1;
        seg[i] = x;
        while(i > 0){
            i = (i-1)/2;
            seg[i] = f(seg[2*i+1], seg[2*i+2]);
        }
    }
    //i番目の要素を取得
    T at(int i){
        return seg[i+n-1];
    }
    //i番目のノードについて、遅延評価(遅延配列の伝搬)をする
    void eval(int i, int l, int r){
        if(lazy[i] != other){
            seg[i] = f(seg[i], lazy[i]);
            if(r-l > 1){
                lazy[2*i+1] = f(lazy[2*i+1] ,lazy[i]/2);
                lazy[2*i+2] = f(lazy[2*i+2], lazy[i]/2);
            }
            lazy[i] = other;
        }
    }
    //add(a, b, x)で[a,b)にxを右から演算する
    void add(int a, int b, T x, int k = 0, int l = 0, int r = -1){
        if(r < 0) r = n;
        eval(k, l, r);
        if(a >= r || b <= l) return;
        elif(a <= l && r <= b){
            //演算の内容によって右から何を演算するかは異なる
            lazy[k] = f(lazy[k], (r-l)*x);
            eval(k, l, r);
        }
        else{
            add(a, b, x, 2*k+1, l, (l+r)/2);
            add(a, b, x, 2*k+2, (l+r)/2, r);
            seg[k] = f(seg[2*k+1],seg[2*k+2]);
        }
    }
    //query(a, b)で[a, b)における演算の結果を取得
    T query(int a, int b, int i = 0, int l = 0, int r = -1){
        if(r < 0) r = n;
        if(a >= r || b <= l) return other;
        eval(i, l, r);
        if(a <= l && r <= b) return seg[i];
        else{
            T vl = query(a, b, 2*i+1, l, (l+r)/2);
            T vr = query(a, b, 2*i+2, (l+r)/2, r);
            return f(vl, vr);
        }
    }
    //初期化する
    void clear(){
        fill(seg, seg+2*n-1, other);
        fill(lazy, lazy+2*n-1, other);
    }
};

int main(){
    int N, K, C;
    cin >> N >> K >> C;
    string S;
    cin >> S;
    //l[i]:=i日目までで何回働けるか
    //r[i]:=(i+1)日目以降で最大何回働けるか
    int l[N+1], r[N+1], now = -inf;
    l[0] = 0;
    rep2(i, 1, N){
        if(S[i-1] == 'o' && i-1 > now+C){
            l[i] = l[i-1]+1;
            now = i-1;
        }
        else l[i] = l[i-1];
    }
    now = inf;
    r[N] = 0;
    rep3(i, N-1, 0){
        if(S[i] == 'o' && i < now-C){
            r[i] = r[i+1]+1;
            now = i;
        }
        else r[i] = r[i+1];
    }
    //rep(i, N+1) cout << l[i] << ' ';
    //cout << endl;
    //rep(i, N+1) cout << r[i] << ' ';
    //cout << endl;
    if(C == 0){
        rep2(i, 1, N){
            if(l[i-1]+r[i] < K) cout << i << endl;
        }
        return 0;
    }
    lazy_segment_tree seg(N+1);
    //[i-C+1, i]を封鎖してできるかどうか
    rep2(i, 1, N+C-1){
        ll sum = 0;
        if(i+1 <= N) sum += r[i];
        if(i-C >= 1) sum += l[i-C];
        //この区間を使わなくてもできる
        if(sum >= K) {
          //cout << i << endl;
          seg.add(max(i-C+1, 1), min(i+1, N+1), 1);
        }
    }
    rep2(i, 1, N){
        if(S[i-1] == 'o' && seg.query(i, i+1) == 0) cout << i << endl;
    }
}

Measured memory_bytes: 14468