//
//  main.cpp
//

#include <algorithm>
#include <array>
#include <assert.h>
#include <complex>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <memory>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std;

using ll = int64_t;
using ull = uint64_t;
constexpr ll LL_MAX = numeric_limits<ll>::max();
constexpr ull ULL_MAX = numeric_limits<ull>::max();

template<typename T>
vector<T> make_vec_nd(T init, ll size) {
	return vector<T>(size, init);
}
template<typename T, typename... Args>
auto make_vec_nd(T init, ll size, Args... rest) {
	auto inner = make_vec_nd(init, rest...);
	return vector<decltype(inner)>(size, inner);
}

#define rep(i, a, b) for (ll i = (a); i < (b); i++)
#define rrep(i, a, b) for (ll i = (a)-1; i >= (b); i--)

template<typename Monoid>
struct SegmentTree {
    using Op = function<Monoid(const Monoid& lhs, const Monoid& rhs)>;
    ll width;
    vector<Monoid> node;
    Op op;
    Monoid unit;
    
    SegmentTree(ll N, Op op, Monoid unit)
    : SegmentTree(vector<Monoid>(N, unit), op, unit) {}
    SegmentTree(const vector<Monoid>& elems, Op op, Monoid unit)
    : op(op)
    , unit(unit) {
        width = 1;
        while (width < elems.size()) {
            width *= 2;
        }
        node.resize(2 * width - 1, unit);
        for (size_t i = 0; i < elems.size(); i++) {
            node[i + width - 1] = elems[i];
        }
        for (size_t i = width - 2; i != numeric_limits<size_t>::max(); i--) {
            node[i] = op(node[2 * i + 1], node[2 * i + 2]);
        }
    }
    void update(ll idx, Monoid elem) {
        idx += width - 1;
        node[idx] = elem;
        while (idx >= 1) {
            idx = (idx - 1) / 2;
            node[idx] = op(node[2 * idx + 1], node[2 * idx + 2]);
        }
    }
    Monoid query_core(ll a, ll b, ll root, ll left, ll right) const {
        // assert([left, right) = root以下にある範囲)
        assert(0 <= a && b <= width);
        if (right <= a || b <= left) {
            return unit;
        }
        if (a <= left && right <= b) {
            return node[root];
        }
        ll mid = (left + right) / 2;
        Monoid ans_l = query_core(a, b, 2 * root + 1, left, mid);
        Monoid ans_r = query_core(a, b, 2 * root + 2, mid, right);
        return op(ans_l, ans_r);
    }
    Monoid query(ll a, ll b) const {
        assert(0 <= a && b <= width);
        return query_core(a, b, 0, 0, width);
    }
    Monoid operator[](size_t idx) { return query(idx, idx + 1); }
};

int main() {
    ll N, K, C;
    cin >> N >> K >> C;
    string S;
    cin >> S;
    vector<ll> dpl(N+1);
    vector<ll> dpr(N+1);
    rep(phase,0,2) {
        vector<ll>* dp = (phase == 0) ? &dpl : &dpr;
        rep(i,1,N+1) {
            (*dp)[i] = (*dp)[i-1];
            if (S[i-1] == 'o') {
                ll dpimC = 0;
                if (i-1-C >= 0) {
                    dpimC = (*dp)[i-1-C];
                }
                (*dp)[i] = max((*dp)[i], dpimC + 1);
            }
        }
        reverse(S.begin(), S.end());
    }
    reverse(dpr.begin(), dpr.end());
    if (C == 0) {
        vector<ll> dp(N);
        rep(i,0,N) {
//            dp[i] = dpl[i] + dpr[i+1];
            dp[i] = dpl[i];
            if (i+1 < dpr.size()) {
                dp[i] += dpr[i+1];
            }
            if (dp[i] <= K-1) {
                cout << i+1 << endl;
            }
        }
    } else {
        vector<ll> dp(2*N);
        rep(i,0,2*N) {
            if (i-N >= 0) {
                dp[i] += dpl[i-N];
            }
            if (i-N+C < dpr.size()) {
                dp[i] += dpr[i-N+C];
            }
        }
        SegmentTree<ll> tree(dp, [](ll lhs, ll rhs){ return max(lhs, rhs); }, numeric_limits<ll>::min());
        rep(i,0,N) {
            ll q = tree.query(i+N+1-C, i+N+1);
            if (q <= K-1) {
                cout << i+1 << endl;
            }
        }
    }
}


Measured memory_bytes: 15100