#include"bits/stdc++.h"
using namespace std;
#define REP(k,m,n) for(int (k)=(m);(k)<(n);(k)++)
#define rep(i,n) REP((i),0,(n))
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using tp3 = tuple<int, int, int>;
using Mat = vector<vector<ll>>;
constexpr int INF = 1 << 28;
constexpr ll INFL = 1ll << 60;
constexpr int dh[4] = { 0,1,0,-1 };
constexpr int dw[4] = { -1,0,1,0 };
bool isin(const int H, const int W, const int h, const int w) {
    return 0 <= h && h < H && 0 <= w && w < W;
}
template<typename T>
T minch(T& l, T r) {
    return l = min(l, r);
}
template<typename T>
T maxch(T& l, T r) {
    return l = max(l, r);
}
template<typename T>
void output(const T& val) {
    cout << val << endl;
}
template<typename T>
void output(const vector<T>& vec, const bool newline = false) {
    for (const T& val : vec)cout << val << (newline ? '\n' : ' '); cout << endl;
}
template<typename T>
void output(const vector<vector<T>>& mat) {
    for (const auto& row : mat)output(row);
}
// ============ template finished ============

template<typename T>
class SegmentTree {
private:
    using F = function<T(T, T)>; // モノイド型
    int n; // 横幅
    F f;   // モノイド
    T e;   // モノイド単位元
    vector<T> data;

public:
    // init忘れに注意
    SegmentTree() {}
    SegmentTree(F f, T e) :f(f), e(e) {}
    void init(int n_) {
        n = 1;
        while (n < n_)n <<= 1;
        data.assign(n << 1, e);
    }
    void build(const vector<T>& v) {
        int n_ = v.size();
        init(n_);
        rep(i, n_)data[n + i] = v[i];
        for (int i = n - 1; i >= 0; i--) {
            data[i] = f(data[(i << 1) | 0], data[(i << 1) | 1]);
        }
    }
    void set_val(int idx, T val) {
        idx += n;
        data[idx] = val;
        while (idx >>= 1) {
            data[idx] = f(data[(idx << 1) | 0], data[(idx << 1) | 1]);
        }
    }
    T query(int a, int b) {
        // [a,b)
        T vl = e, vr = e;
        for (int l = a + n, r = b + n; l < r; l >>= 1, r >>= 1) {
            if (l & 1)vl = f(vl, data[l++]); // unknown
            if (r & 1)vr = f(data[--r], vr); // unknown
        }
        return f(vl, vr);
    }
};

SegmentTree<int> max_work(const int C, string s) {
    const int N = s.size();
    auto f = [](int l, int r) {return max(l, r); };
    SegmentTree<int> seg(f, 0);
    seg.init(N);
    rep(i, N)if (s[i] == 'o') {
        int num = seg.query(0, i - C);
        seg.set_val(i, num + 1);
    }
    return seg;
}

vector<int> to_vector(const int N, SegmentTree<int>& seg) {
    vector<int> res;
    rep(i, N)res.push_back(seg.query(0, i + 1));
    return res;
}

void special_version(string S, int K) {
    int cnt = 0;
    for (char c : S)if (c == 'o')cnt++;
    if (cnt == K) {
        rep(i, S.size())if (S[i] == 'o') {
            cout << i + 1 << " ";
        }
        cout << endl;
    }
}

set<int> solve(int N, int K, int C, string S) {
    auto norm = max_work(C, S);
    auto normV = to_vector(N, norm);
    reverse(S.begin(), S.end());
    auto rev = max_work(C, S);
    auto revV = to_vector(N, rev);
    reverse(S.begin(),S.end());
    set<int> st;
    rep(i, N)if (S[i] == 'o') {
        int vl = norm.query(0, i);
        int idxl = lower_bound(normV.begin(), normV.end(), vl) - normV.begin();
        int idxR = idxl + C;
        if (vl == 0)idxR = 0;
        idxR = max(idxR, i + 1);
        idxR = N - 1 - idxR;

        int vr = rev.query(0, idxR + 1);
        if (vl + vr == K - 1) {
            st.insert(i);
        }
    }
    return st;
}

int main()
{
    int N, K, C;
    string S;
    cin >> N >> K >> C >> S;
    if (C == 0) {
        special_version(S, K);
        return 0;
    }
    auto st1 = solve(N, K, C, S);
    reverse(S.begin(), S.end());
    auto st2 = solve(N, K, C, S);
    for (auto day : st2) {
        st1.insert(N - 1 - day);
    }
    for (auto day : st1)output(day + 1);
    return 0;
}


Measured memory_bytes: 7696