#include <chrono>

#include <iostream>
#include <iomanip>
#include <algorithm>
#include <bitset>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <cmath>
#include <time.h>
#include <random>
#include <string>
#include <cassert>
#include <vector>
#include <ostream>
#include <istream>
#include <stack>
#include <deque>
#include <queue>
#include <functional>

using namespace std;

#define int long long
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define pii pair<int, int>
#define ld long double

ostream& operator << (ostream &a, const vector<int> &b) {
    for (auto k : b) cout << k << " ";
    return a;
}

#ifdef LOCAL
    #define dbg(x) cout << #x << " : " << (x) << "\n";
    const int INF = 1e18;
//    const int mod = 2600000069;
//    const int p = 10;
//    const ld PI = 3.1415926535;
#else
    #define dbg(x)
    const int INF = 1e18;
//    const int mod = 2600000069;
//    const int p = 179;
//    const ld PI = 3.1415926535;
#endif

//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,sse3,sse4")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("fast-math")
//#pragma GCC target("avx2")
//#pragma GCC optimize("section-anchors")
//#pragma GCC optimize("profile-values,profile-reorder-functions,tracer")
//#pragma GCC optimize("vpt")
//#pragma GCC optimize("rename-registers")
//#pragma GCC optimize("move-loop-invariants")
//#pragma GCC optimize("unswitch-loops")
//#pragma GCC optimize("function-sections")
//#pragma GCC optimize("data-sections")

int n, k, c;

string s;
vector<int> pref, suf, lstpref, lstsuf;

int mxpref(int ind) {
    if (ind < 0) return 0;
    return pref[ind];
}

int mxsuf(int ind) {
    if (ind >= n) return 0;
    return suf[ind];
}

int getlstp(int ind) {
    if (ind == 0) return -INF;
    return lstpref[ind - 1];
}

int getlsts(int ind) {
    if (ind == n - 1) return INF;
    return lstsuf[ind + 1];
}

int count(int ind) {
    int ans = mxpref(ind - 1) + mxsuf(ind + 1);
    if (getlstp(ind) + c >= getlsts(ind)) {
        ans--;
    }
    return ans;
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    #ifdef LOCAL
    #else
//        freopen("capitals.in", "r", stdin);
//        freopen("capitals.out", "w", stdout);
    #endif
    cin >> n >> k >> c;
    cin >> s;
    if (n == 1 && k == 1) {
        cout << 1;
        return 0;
    } else if (n == 1) return 0;
    vector<int> a(n);
    for (int i = 0; i < n; i++) {
        if (s[i] == 'o') a[i] = 1;
        else a[i] = 0;
    }
    pref.resize(n);
    suf.resize(n);
    lstpref.assign(n, -INF), lstsuf.assign(n, INF);
    int cur = 0;
    int rest = 0;
    if (a[0]) {
        cur = 1;
        rest = c + 1;
        lstpref[0] = 0;
    }
    pref[0] = cur;
    for (int i = 1; i < n; i++) {
        rest = max(rest - 1, 0LL);
        pref[i] = pref[i - 1];
        lstpref[i] = lstpref[i - 1];
        if (a[i] && !rest) {
            pref[i]++;
            lstpref[i] = i;
            rest = c + 1;
        }
    }
    cur = 0, rest = 0;
    if (a[n - 1]) {
        cur = 1;
        rest = c + 1;
        lstsuf[n - 1] = n - 1;
    }
    suf[n - 1] = cur;
    for (int i = n - 2; i >= 0; i--) {
        rest = max(rest - 1, 0LL);
        suf[i] = suf[i + 1];
        lstsuf[i] = lstsuf[i + 1];
        if (a[i] && !rest) {
            suf[i]++;
            lstsuf[i] = i;
            rest = c + 1;
        }
    }
//    dbg(pref)
//    dbg(lstpref)
//    dbg(suf)
//    dbg(lstsuf)
    for (int i = 0; i < n; i++) {
//        dbg(i)
//        dbg(mxpref(min(nxt[i] - c, i - 1)))
//        dbg(mxsuf(nxt[i]))
//        cout << count(i) << " ";
        if (count(i) < k && a[i]) {
            cout << i + 1 << "\n";
        }
    }
}
/*
*/


Measured memory_bytes: 9620