#include<bits/stdc++.h>
using namespace std;


#define li          long long int
#define rep(i,to)   for(li i=0;i<((li)(to));i++)
#define repp(i,start,to)    for(li i=(li)(start);i<((li)(to));i++)
#define pb          push_back
#define sz(v)       ((li)(v).size())
#define bgn(v)      ((v).begin())
#define eend(v)     ((v).end())
#define allof(v)    (v).begin(), (v).end()
#define dodp(v,n)       memset(v,(li)n,sizeof(v))
#define bit(n)      (1ll<<(li)(n))
#define mp(a,b)     make_pair(a,b)
#define rin rep(i,n)
#define EPS 1e-12
#define ETOL 1e-8
#define MOD 1000000007
typedef pair<li, li> PI;

#define INF bit(60)

#define DBGP 1


#define idp if(DBGP)
#define F first
#define S second
#define p2(a,b)     idp cout<<a<<"\t"<<b<<endl
#define p3(a,b,c)       idp cout<<a<<"\t"<<b<<"\t"<<c<<endl
#define p4(a,b,c,d)     idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<endl
#define p5(a,b,c,d,e)       idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<endl
#define p6(a,b,c,d,e,f)     idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<endl
#define p7(a,b,c,d,e,f,g)       idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<endl
#define p8(a,b,c,d,e,f,g,h)     idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<endl
#define p9(a,b,c,d,e,f,g,h,i)       idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<"\t"<<i<<endl
#define p10(a,b,c,d,e,f,g,h,i,j)        idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<"\t"<<i<<"\t"<<j<<endl
#define foreach(it,v)   for(__typeof((v).begin()) it=(v).begin(); it!=(v).end(); ++it)
#define p2p(x)      idp p2((x).F, (x).S)
#define dump(x,n)   idp{rep(i,n){cout<<x[i]<<" ";}puts("");}
#define dump2(x,n)  idp{rep(i,n){cout<<"["<<x[i].F<<" , "<<x[i].S<<"] ";}puts("");}
#define dumpi(x)    idp{foreach(it, x){cout<<(*it)<<" ";}puts("");}
#define dumpi2(x)   idp{foreach(it, x){cout<<"["<<(it)->F<<" , "<<(it)->S<<"] ";}puts("");}

#define read2d(a,w,h)   rep(i,h)rep(j,w)cin>>a[i][j]
#define dump2d(a,w,h)   rep(i,h){rep(j,w)cout<<a[i][j]<<" ";puts("");}

typedef pair<li, li> PI;

li n, k, c;
string s;

li sum_left[200200];
li last_left[200200];
li sum_right[200200];
li last_right[200200];

int main() {
    cin >> n >> k >> c;
    cin >> s;

    sum_left[0] = 0;
    rep(i, n) {
        if (s[i] == 'o') {
            if (sum_left[i] >= sum_left[max(0ll, i - c)] + 1) {
                sum_left[i + 1] = sum_left[i];
                last_left[i + 1] = last_left[i];
            } else {
                sum_left[i + 1] = sum_left[max(0ll, i - c)] + 1;
                last_left[i + 1] = i + 1;
            }
        } else {
            sum_left[i + 1] = sum_left[i];
            last_left[i + 1] = last_left[i];
        }
    }

    sum_right[n] = 0;
    for (li i = n - 1; i >= 0; i--) {
        if (s[i] == 'o') {
            if (sum_right[i + 1] >= sum_right[min(n, i + c + 1)] + 1) {
                sum_right[i] = sum_right[i + 1];
                //last_right[i] = last_left[i + 1];
            } else {
                sum_right[i] = sum_right[min(n, i + c + 1)] + 1;
                //last_right[i] = i;
            }
        } else {
            sum_right[i] = sum_right[i + 1];
        }
    }

    rin{
        if (s[i] == 'o') {
            if (sum_left[i] == 0) {
                if (sum_right[i + 1] < k) {
                    cout << i + 1 << endl;
                }
            } else {
                li last_l = last_left[i] - 1;
                li cnt = sum_left[i];
                //p5(i, last_l, cnt, min(n, last_l + c + 1), sum_right[min(n, last_l + c + 1)]);
                cnt += sum_right[max(i + 1, min(n, last_l + c + 1))];
                if (cnt < k) {
                    cout << i + 1 << endl;
                }
            }
        }
    }

    //dump(sum_left, n + 1);
    //dump(sum_right, n + 1);

    return 0;
}

Measured memory_bytes: 6532