#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 2e5 + 10;
const int INF = 0x3f3f3f3f;
int n, k, c;
char s[N];
int L[N], R[N];
int main() {
	scanf("%d%d%d", &n, &k, &c);
	scanf("%s", s + 1);
	int cur = 1, d = 0;
	while (cur <= n) {
		if (s[cur] == 'o') {
			L[++d] = cur;
			cur += c;
		}
		cur++;
	}
	cur = n, d = 0;
	while (cur >= 1) {
		if (s[cur] == 'o') {
			R[++d] = cur;
			cur -= c;
		}
		cur--;
	}
	if (L[k + 1])puts("");
	else {
		reverse(R + 1, R + d + 1);
		for (int i = 1; i <= d; i++) {
			if (L[i] == R[i])printf("%d\n", L[i]);
		}
	}
	return 0;
}