#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) REP(i,0,n)
#define REP(i,s,e) for(int i=(s); i<(int)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for(int i=(int)(s-1); i>=(int)(e); i--)
#define pb push_back
#define all(r) r.begin(),r.end()
#define rall(r) r.rbegin(),r.rend()
#define fi first
#define se second

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const ll INF = 1e18;
const ll MOD = 1e9 + 7;
const double EPS = 1e-8;

template<typename T> T chmax(T& a, const T& b){return a = (a > b ? a : b);}
template<typename T> T chmin(T& a, const T& b){return a = (a < b ? a : b);}

using ull = unsigned long long;


constexpr ll initVal = -(1LL<<31)-1;     //TODO: fix type and value
constexpr ll initLazy = (1LL<<60)-1;    //TODO: fix type and value
template <typename T>
struct Node {
    T val;
    T lazy;
    ull l, r;
    Node<T>* l_node = nullptr;
    Node<T>* r_node = nullptr;
    Node(ull l, ull r, const T& val = initVal) : l(l), r(r), val(val), lazy(initLazy) {}
    T getVal() {
        return (lazy != initLazy ? lazy : val); //TODO: fix
    }
    T f1(const T& a, const T& b) {
        return max(a, b);               //TODO: fix
    }
    T f2(const T& a, const T& b) {
        return b;                       //TODO: fix
    }
    void push() {
        if(r - l > 1) {
            auto m = (l+r)/2;
            {
                if(l_node == nullptr) l_node = new Node(l, m);
                if(lazy != initLazy) l_node->lazy = f2(l_node->lazy, this->lazy);
            }
            {
                if(r_node == nullptr) r_node = new Node(m, r);
                if(lazy != initLazy) r_node->lazy = f2(r_node->lazy, this->lazy); 
            }
        }
        val = getVal();
        lazy = initLazy;
    }
    void fix() {
        if(r - l == 1) return;
        val = f1(l_node->getVal(), r_node->getVal());
    }
    T query(ull qL, ull qR) {
        if(qR <= l || r <= qL) return initVal;
        if(qL <= l && r <= qR) return getVal();
        if(r - l == 1)  return getVal();

        push();
        T l_val = l_node->query(qL, qR), r_val = r_node->query(qL, qR);
        return f1(l_val, r_val);
    }
    void update(ull uL, ull uR, const T& uVal) {
        if(uR <= l || r <= uL) return;
        if(uL <= l && r <= uR) lazy = f2(lazy, uVal);
        else {
            push();
            l_node->update(uL, uR, uVal);
            r_node->update(uL, uR, uVal);
            fix();
        }
    }
};

template <typename T>
struct DynamicLazySegTree {
    Node<T> root;
    DynamicLazySegTree(ull l, ull r, const T& val) : root(l, r, val) {}
    T query(ull l, ull r) {
        return root.query(l, r);
    }
    void update(ull l, ull r, const T& val) {
        root.update(l, r, val);
    }
};

// #define DEBUG_MODE
#ifdef DEBUG_MODE
#define dump(x) cout << #x << " : " << x << " "
#define dumpL(x) cout << #x << " : " << x << '\n'
#define LINE cout << "line : " << __LINE__ << " "
#define LINEL cout << "line : " << __LINE__ << '\n'
#define dumpV(v) cout << #v << " : ["; for(auto& t : v) cout << t << ", "; cout<<"]" << " "
#define dumpVL(v) cout << #v << " : ["; for(auto& t : v) cout << t << ", "; cout<<"]" << endl
#define STOP assert(false)
#else
#define dump(x) 
#define dumpL(x) 
#define LINE 
#define LINEL 
#define dumpV(v) 
#define dumpVL(v) 
#define STOP assert(false)
#endif
#define mp make_pair
 
namespace std {
template<class S, class T>
ostream &operator <<(ostream& out, const pair<S, T>& a) {
    out << '(' << a.fi << ", " << a.se << ')';
    return out;
}
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll n, k, c;
    cin >> n >> k >> c;
    string s;
    cin >> s;
    auto calc =[&] {
        vl res(n+1);
        rep(i, n) {
            if(s[i] != 'x') {
                res[i+1] = 1;
                if(i >= c) chmax(res[i+1], res[i-c]+1);
            }
            chmax(res[i+1], res[i]);
        }
        return res;
    };
    auto left = calc();
    reverse(all(s));
    auto right = calc();
    reverse(all(right));

    

    dumpVL(left);
    dumpVL(right);
    
    queue<ll> q;
    multiset<ll> st;

    auto get_L = [&](int i) {
        if(i < 0 || i >= (int)left.size()) return 0LL;
        return left[i];
    };
    auto get_R= [&](int i) {
        if(i < 0 || i >= (int)right.size()) return 0LL;
        return right[i];
    };

    if(c == 0) {
        rep(i, n) {
            if(get_L(i) + get_R(i+1) < k) {
                cout << i+1 << '\n';
            }       
        }
        return 0;
    }

    rep(i, c) {
        ll cur = get_L(i) + get_R(i+c);
        dump(i);dump(get_L(i));dump(get_R(i+c)); dumpL(cur);
        q.push(-cur);
        st.insert(-cur);
        ll ma = -(*st.begin());
        if(max(ma, get_R(i+1)) < k) cout << i+1 << '\n';
    }
    REP(i, c, n) {
        ll cur = get_L(i) + get_R(i+c);
        dump(i);dump(cur);

        auto p = q.front();
        q.pop();
        auto it = st.lower_bound(p);
        st.erase(it);

        q.push(-cur);
        st.insert(-cur);

        

        ll ma = -(*st.begin());
        dumpL(ma);
        if(max(ma, get_R(i+1)) < k) cout << i+1 << '\n';
    }
    return 0;
}

Measured memory_bytes: 5012