#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>

#define x first
#define y second
#define ndl '\n'
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define up_b upper_bound
#define low_b lower_bound
#define sz(x) (int)x.size()
#define bit __builtin_popcount
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

using namespace std;
using namespace __gnu_pbds;

template<typename T> using indexed_set = tree <T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

typedef long long ll;
typedef long double ld;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef pair<int, ll> pil;
typedef pair<ll, int> pli;
typedef pair<int, ull> piu;
typedef vector<vector<int>> matrix;

const ll INF = 1e18 + 123;
const ld EPS = 1e-9;
const int inf = 1e9 + 123;
const int MOD = 1e9 + 7;
const int N = 5e5 + 123;
const int M = 1e6 + 123;
const double pi = acos(-1.0);
const int dx[] = {0, 0, 1, -1};
const int dy[] = {1, -1, 0, 0};

int pr[N], sf[N];

char s[N];

void solve(){
    int n, k, c;
    cin >> n >> k >> c;
    c++;
    vector<int> x;
    for (int i = 1; i <= n; i++){
        cin >> s[i];
        if (s[i] == 'o'){
            x.pb(i);
            if (i >= c){
                pr[i] = pr[i-c]+1;
            }
            else{
                pr[i] = 1;
            }
        }
        else{
            pr[i] = pr[i-1];
        }
        //cout << pr[i] << " ";
    }
    for (int i = n; i >= 1; i--){
        if (s[i] == 'o'){
            if (i + c <= n){
                sf[i] = sf[i+c]+1;
            }
            else{
                sf[i] = 1;
            }
        }
        else{
            sf[i] = sf[i+1];
        }
    }
    for (int i = 1; i <= n; i++){
  //      cout << i << " " << pr[i] << " " << sf[i] << endl;
    }
    if (sz(x) == 1){
        cout << x[0];
        return;
    }
    set<pii> s;
    s.insert({sf[x[1]], x[1]});
    for (int i = 0; i < sz(x); i++){
        for(;;){
            pii p = *s.rbegin();
            if (x[i] >= p.y){
                s.erase(p);
            }
            else{
                break;
            }
        }
        //cout << " " << s.rbegin()->y << endl;
        if (s.rbegin()->x < k){
            cout << x[i] << endl;
        }
        int j = low_b(all(x), x[i]+c) - x.begin();
        int cur = 0, r = inf;
        if (j < sz(x)){
            r = x[j];
            cur += sf[r];
        }

        cur += pr[x[i]];
      //  cout << cur << " " <<x[i] << " "<< r << endl;
        s.insert({cur, r});
        cur = 0, r = inf;
        j++;
        if (j < sz(x)){
            r = x[j];
            cur += sf[r];
        }
        cur += pr[x[i]];
        //cout << cur << " " <<x[i]<< " "<< r << endl<<endl;
        s.insert({cur, r});
    }

}

int main(){
    #ifdef KAZAKH
        freopen("input.txt", "r", stdin);
    #endif
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int t = 1;
    //cin >> t;
    for (int i = 1; i <= t; i++){
        //cout << "case #" << i << ": ";
        solve();
    }
    return 0;
}


Measured memory_bytes: 14708