// Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools

#include <bits/stdc++.h>

using namespace std;

using i64 = long long;

const i64 MOD = 1e9 + 7;
const i64 INF = i64(1e18) + 7;


template <typename T>
bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

template <typename T>
bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}


template <typename T>
struct DisjointSparseTable{
    function<T(T, T)> f;
    vector<vector<T>> v;

    DisjointSparseTable(vector<T>& inp, function<T(T, T)> f) : f(f){
        int n = inp.size();
        int b;
        for(b = 0; (1 << b) <= inp.size(); ++b);
        v.assign(b, vector<T>(n));
        for(int i = 0; i < n; ++i)
            v[0][i] = inp[i];
        for(int i = 1; i < b; ++i){
            int siz = 1 << i;
            for(int j = 0; j < n; j += siz << 1){
                int t = min(j + siz, n);
                v[i][t - 1] = inp[t - 1];
                for(int k = t - 2; k >= j; --k)
                    v[i][k] = f(inp[k], v[i][k + 1]);
                if(t >= n)
                    break;
                v[i][t] = inp[t];
                int r = min(t + siz, n);
                for(int k = t + 1; k < r; ++k)
                    v[i][k] = f(v[i][k - 1], inp[k]);
            }
        }
    }

    T get(int l, int r, T op){
        if(l >= r)
            return op;
        if(l >= --r)
            return v[0][l];
        int p = 31 - __builtin_clz(l ^ r);
        return f(v[p][l], v[p][r]);
    }
};


void solve(long long n, long long k, long long c, std::string s){

    vector<int> v(n), v2(n);
    for(int i = 0; i < n; ++i){
        v[i] = (s[i] == 'o' ? i : MOD);
        v2[i] = (s[i] == 'o' ? i : -MOD);
    }
    DisjointSparseTable<int> table(v, [](auto x, auto y){return min(x, y);});
    DisjointSparseTable<int> table2(v2, [](auto x, auto y){return max(x, y);});
    vector<int> w(n, MOD), w2(n, -MOD);
    for(int i = 0; i < n; ++i)
        if(s[i] == 'o'){
            w[i] = table.get(i + c + 1, n, MOD);
            w2[i] = table2.get(0, i - c, -MOD);
        }


    vector<vector<int>> edges(n), rev(n);
    for(int i = 0; i < n; ++i){
        if(w[i] != MOD)
            edges[i].emplace_back(w[i]);
        if(w2[i] != -MOD)
            rev[i].emplace_back(w2[i]);
    }

    vector<int> dp(n, 0), dp2(n, 0);
    for(int i = 0; i < n; ++i)
        if(s[i] == 'o'){
            dp[i] = 1;
            dp2[i] = 1;
        }

    for(int i = n - 1; i >= 0; --i)
        if(abs(w[i]) != MOD)
            dp[i] = dp[w[i]] + 1;
    for(int i = 0; i < n; ++i)
        if(abs(w2[i]) != MOD)
            dp2[i] = dp2[w2[i]] + 1;

    DisjointSparseTable<int> d1(dp, [](auto x, auto y){return max(x, y);});
    DisjointSparseTable<int> d2(dp2, [](auto x, auto y){return max(x, y);});
    for(int i = 0; i < n; ++i){
        i64 sum = d2.get(0, i, 0) + d1.get(i + 1, n, 0);
        if(sum < k)
            cout << i + 1 << endl;
    }

}


signed main(){
    long long N;
    scanf("%lld",&N);
    long long K;
    scanf("%lld",&K);
    long long C;
    scanf("%lld",&C);
    std::string S;
    std::cin >> S;
    solve(N, K, C, S);
    return 0;
}


Measured memory_bytes: 85492