/* Generated by powerful Codeforces Tool
 * You can download the binary file in here https://github.com/xalanq/cf-tool (win, osx, linux)
 * Author: step_by_step
 * Time: 2020-03-19 17:35:03
**/

//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("unroll-loops")
  
#include <iostream>
#include <stdlib.h>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <assert.h>
#include <memory.h>
#include <time.h>
#include <bitset>

#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define ld long double
#define rep(i, l, r) for (int i = (l); i < (r); i++)
#define repb(i, r, l) for (int i = (r); i > (l); i--)
#define sz(a) (int)a.size()
#define fi first
#define se second
#define mp(a, b) make_pair(a, b)
#define rank qwertyuio
#define next dfghjk
#define prev fhsgfhjf
#define plus fsghsf
#define minus ytryr
  
using namespace std;
  
inline bool setmin(int &x, int y) { return (y < x) ? x = y, 1 : 0; }
inline bool setmax(int &x, int y) { return (y > x) ? x = y, 1 : 0; }
inline bool setmin(ll &x, ll y) { return (y < x) ? x = y, 1 : 0; }
inline bool setmax(ll &x, ll y) { return (y > x) ? x = y, 1 : 0; }
  
const int N = 100000;
const int inf = (int)1e9 + 1;
const ll big = (ll)1e18 + 1;
const int P = 239;
const int P1 = 31;
const int P2 = 57;
const int MOD = (int)1e9 + 7;
const int MOD1 = (int)1e9 + 9;
const int MOD2 = 998244353;
const ld eps = 1e-9;
const double pi = atan2(0, -1);
const int ABC = 26;

int main()
{
    //freopen("circus.in", "r", stdin);
    //freopen("circus.out", "w", stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.precision(20);
    cout << fixed;
    //ll TL = 10.95 * CLOCKS_PER_SEC;
    //clock_t time = clock();
    int n, k, c;
    cin >> n >> k >> c;
    string s;
    cin >> s;
    vector<bool> work_pref(n, false);
    int cur = 0;
    while (cur < n) {
        if (s[cur] != 'x') {
            work_pref[cur] = true;
            cur += 1 + c;
        } else {
            cur++;
        }
    }
    int cnt_pref[n], last_pref[n];
    rep(i, 0, n) {
        cnt_pref[i] = (i > 0 ? cnt_pref[i - 1] : 0) + work_pref[i];
        last_pref[i] = (work_pref[i] ? i : (i > 0 ? last_pref[i - 1] : -inf));
    }
    vector<bool> work_suff(n, false);
    cur = n - 1;
    while (cur >= 0) {
        if (s[cur] != 'x') {
            work_suff[cur] = true;
            cur -= 1 + c;
        } else {
            cur--;
        }
    }
    int cnt_suff[n], last_suff[n];
    repb(i, n - 1, -1) {
        cnt_suff[i] = (i < n - 1 ? cnt_suff[i + 1] : 0) + work_suff[i];
        last_suff[i] = (work_suff[i] ? i : (i < n - 1 ? last_suff[i + 1] : inf));
    }

    rep(i, 0, n) {
        int c1, l1, c2, l2;
        if (i - 1 >= 0) {
            c1 = cnt_pref[i - 1];
            l1 = last_pref[i - 1];
        } else {
            c1 = 0;
            l1 = -inf;
        }
        if (i + 1 < n) {
            c2 = cnt_suff[i + 1];
            l2 = last_suff[i + 1];
        } else {
            c2 = 0;
            l2 = inf;
        }
        if (l2 - l1 - 1 < c) {
            c1--;
        }
        if (c1 + c2 < k) {
            cout << i + 1 << "\n";
        }
    }
    return 0;
}



Measured memory_bytes: 5012