#include <bits/stdc++.h>
#define int long long
#define ll long long
using ull = unsigned long long;
using namespace std;
const int INF = 1ll << 60;
const int MOD = 1e9 + 7;
#define dump(x)                             \
    if (dbg) {                              \
        cerr << #x << " = " << (x) << endl; \
    }
#define overload4(_1, _2, _3, _4, name, ...) name
#define FOR1(n) for (ll i = 0; i < (n); ++i)
#define FOR2(i, n) for (ll i = 0; i < (n); ++i)
#define FOR3(i, a, b) for (ll i = (a); i < (b); ++i)
#define FOR4(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)
#define FORR(i, a, b) for (int i = (a); i <= (b); ++i)
#define bit(n, k) ((n >> k) & 1) /*nのk bit目*/
template <class T>
bool chmin(T& a, const T& b) {
    if (a > b) {
        a = b;
        return 1;
    } else
        return 0;
}
template <class T>
bool chmax(T& a, const T& b) {
    if (a < b) {
        a = b;
        return 1;
    } else
        return 0;
}
void Yes(bool flag = true) {
    if (flag)
        cout << "Yes" << endl;
    else
        cout << "No" << endl;
}
void No(bool flag = true) {
    Yes(!flag);
}
void YES(bool flag = true) {
    if (flag)
        cout << "YES" << endl;
    else
        cout << "NO" << endl;
}
void NO(bool flag = true) {
    YES(!flag);
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T& val) {
    std::fill((T*)array, (T*)(array + N), val);
}
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define all(v) (v).begin(), (v).end()
#define SZ(x) ((int)(x).size())
#define vi vector<int>
#define vvi vector<vector<int>>
#define vp vector<pair<int, int>>
#define vvp vector<vector<pair<int, int>>>
#define pi pair<int, int>
//#define P pair<int, int>
//#define V vector<int>
//#define S set<int>
#define itn int
#define asn ans
bool dbg = false;


int N, K, C;
string S;
int can[202020];
int pre[202020];
int nxt[202020];
itn max_front[202020];
int max_back[202020];
int ans[202020];
itn M;

void solve() {
    C++;
    M = S.size();
    int now = -1;
    FOR(i, 0, M) {
        if (i >= 1) {
            chmax(max_front[i], max_front[i - 1]);
        }
        if (S[i]) {
            pre[i] = now;
            now = i;

            chmax(max_front[i], 1ll);
            if (i >= C) {
                chmax(max_front[i], max_front[i - C] + 1);
            }
        }
    }
    now = M;
    for (int i = M - 1; i >= 0; i--) {
        if (i < M - 1) {
            chmax(max_back[i], max_back[i + 1]);
        }
        if (S[i]) {
            nxt[i] = now;
            now = i;

            chmax(max_back[i], 1ll);
            if (M - 1 - i >= C) {
                chmax(max_back[i], max_back[i + C] + 1);
            }
        }
    }
    FOR(M) {
        if (S[i]) {
            int tmp = 0;
            if (i >= C) {
                tmp += max_front[i - C];
            }
            if (M - 1 - i >= C) {
                tmp += max_back[i + C];
            }
            tmp++;
            if (tmp == K) {
                can[i]++;
            }
            if (tmp > K)
                return;
        }
        //cerr << i + 1 << " : " << can[i] << endl;
        if (can[i])
            ans[i]++;
    }
    {

        int now = -1;
        FOR(M) {
            if (can[i]) {
                if (now >= 0 && i - now < C) {
                    ans[i] = 0;
                }
                now = i;
            }
        }
        now = M;
        for (int i = M - 1; i >= 0; i--) {
            if (can[i]) {
                if (now < M && now - i < C) {
                    ans[i] = 0;
                }
                now = i;
            }
        }


        /*
        FOR(M) {
            if (S[i]) {
                if (pre[i] >= 0) {
                    if (can[pre[i]])
                        ans[i] = 0;
                }
                if (nxt[i] < M) {
                    if (can[nxt[i]])
                        ans[i] = 0;
                }
            }
        }
        */
    }
    FOR(M) {
        if (ans[i])
            cout << i + 1 << endl;
    }
}

signed main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cin >> N >> K >> C >> S;
    for (auto& c : S) {
        if (c == 'o')
            c = 1;
        else
            c = 0;
    }


    solve();
    return 0;
}


Measured memory_bytes: 11284