#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<int>;
using VL = vector<ll>;
using VS = vector<string>;
template<class T> using PQ = priority_queue<T, vector<T>, greater<T>>;
#define FOR(i,a,n) for(int (i)=(a);(i)<(n);++(i))
#define eFOR(i,a,n) for(int (i)=(a);(i)<=(n);++(i))
#define rFOR(i,a,n) for(int (i)=(n)-1;(i)>=(a);--(i))
#define erFOR(i,a,n) for(int (i)=(n);(i)>=(a);--(i))
#define each(i, a) for(auto &i : a)
#define SORT(i) sort((i).begin(),(i).end())
#define rSORT(i,a) sort((i).begin(),(i).end(),(a))
#define all(i) (i).begin(),(i).end()
#define out(y,x) ((y) < 0 || h <= (y) || (x) < 0 || w <= (x))
#define line cout << "-----------------------------\n" 
#define ENDL(i,n) ((i) == (n) - 1 ? "\n" : " ")
#define stop system("pause")
constexpr ll INF = 1000000000;
constexpr ll LLINF = 1LL << 60;
constexpr ll mod = 1000000007;
constexpr ll MOD = 998244353;
constexpr ld eps = 1e-10;
constexpr ld pi = 3.1415926535897932;
template<class T>inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; }return false; }
template<class T>inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; }return false; }
inline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }
template<class T>inline istream& operator>>(istream& is, vector<T>& v) { for (auto& elemnt : v)is >> elemnt; return is; }
template<class T>inline istream& operator>>(istream& is, deque<T>& v) { for (auto& elemnt : v)is >> elemnt; return is; }
template<class T, class U>inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template<class T>inline vector<T> vec(size_t a) { return vector<T>(a); }
template<class T>inline vector<T> defvec(T def, size_t a) { return vector<T>(a, def); }
template<class T, class... Ts>inline auto vec(size_t a, Ts... ts) { return vector<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); }
template<class T, class... Ts>inline auto defvec(T def, size_t a, Ts... ts) { return vector<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); }

template<class T> class segtree {
    int n = 1;
    vector<T> dat;
    T def;

public:
    segtree() {}
    segtree(const int& _n, const T& _def) : def(_def) {
        while (n < _n)n *= 2;
        dat.resize(2 * n, def);
    }
    segtree(const vector<T>& a, const T& _def) : def(_def) {
        int _n = a.size();
        while (n < _n)n *= 2;
        dat.resize(2 * n, def);
        FOR(i, 0, _n)dat[i + n] = a[i];
        rFOR(i, 1, n)dat[i] = fun(dat[2 * i], dat[2 * i + 1]);
    }

    T fun(T x, T y) { return max(x, y); }

    void update(int i, T a) {
        i += n;
        chmin(dat[i], a);
        while (i > 1) {
            i /= 2;
            dat[i] = fun(dat[2 * i], dat[2 * i + 1]);
        }
    }

    T value(int l, int r) {
        l += n, r += n;

        T ret = def;
        for (; l < r; l /= 2, r /= 2) {
            if (l & 1) {
                ret = fun(ret, dat[l]);
                ++l;
            }
            if (r & 1) {
                --r;
                ret = fun(ret, dat[r]);
            }
        }

        return ret;
    }

    T operator[](int k) { return dat[k + n]; }
};

int main() {
    init();

    int n, k, c; cin >> n >> k >> c;
    string s; cin >> s;
    FOR(i, 0, c + 1)s += 'x';
    n += c + 1;

    VI l(n), r(n);
    FOR(i, c, n) {
        if (0 < i)l[i] = l[i - 1];
        if (s[i - c] == 'o') {
            chmax(l[i], (0 <= i - c - 1 ? l[i - c - 1] : 0) + 1);
        }
    }
    rFOR(i, 0, n - c - 1) {
        r[i] = r[i + 1];
        if (s[i] == 'o') {
            chmax(r[i], (i + c + 1 < n ? r[i + c + 1] : 0) + 1);
        }
    }

    VI x(n);
    FOR(i, 1, n)x[i] = l[i - 1] + r[i];
    segtree<int> seg(x, 0);

    VI idx;
    FOR(i, 0, n - c - 1)if (s[i] == 'o')idx.push_back(i);
    FOR(i, 0, idx.size()) {
        if (i == 0) {
            if (r[idx[i] + 1] < k)cout << idx[i] + 1 << "\n";
        }
        else {
            int a = idx[i] + c - 1, b = idx[i] + 1;
            int cnt = 0;
            chmax(cnt, l[min(a, b - 1)] + r[b]);
            chmax(cnt, l[a] + r[max(b, a + 1)]);
            if (b <= a)chmax(cnt, seg.value(b, a + 1));
            if (cnt < k)cout << idx[i] + 1 << "\n";
        }
    }
}

Measured memory_bytes: 7052