// writer: w33z8kqrqk8zzzx33
#include <bits/stdc++.h>
using namespace std;

// begin fast read template by CYJian (source: https://www.luogu.com.cn/paste/i11c3ppx)

namespace io {
	const int __SIZE = (1 << 21) + 1;
	char ibuf[__SIZE], *iS, *iT, obuf[__SIZE], *oS = obuf, *oT = oS + __SIZE - 1, __c, qu[55]; int __f, qr, _eof;
	#define Gc() (iS == iT ? (iT = (iS = ibuf) + fread (ibuf, 1, __SIZE, stdin), (iS == iT ? EOF : *iS ++)) : *iS ++)
	inline void flush () { fwrite (obuf, 1, oS - obuf, stdout), oS = obuf; }
	inline void gc (char &x) { x = Gc(); }
	inline void pc (char x) { *oS ++ = x; if (oS == oT) flush (); }
	inline void pstr (const char *s) { int __len = strlen(s); for (__f = 0; __f < __len; ++__f) pc (s[__f]); }
	inline void gstr (char *s) { for(__c = Gc(); __c < 32 || __c > 126 || __c == ' ';)  __c = Gc();
		for(; __c > 31 && __c < 127 && __c != ' '; ++s, __c = Gc()) *s = __c; *s = 0; }
	template <class I> inline bool gi (I &x) { _eof = 0;
		for (__f = 1, __c = Gc(); (__c < '0' || __c > '9') && !_eof; __c = Gc()) { if (__c == '-') __f = -1; _eof |= __c == EOF; }
		for (x = 0; __c <= '9' && __c >= '0' && !_eof; __c = Gc()) x = x * 10 + (__c & 15), _eof |= __c == EOF; x *= __f; return !_eof; }
	template <class I> inline void print (I x) { if (!x) pc ('0'); if (x < 0) pc ('-'), x = -x;
		while (x) qu[++ qr] = x % 10 + '0',  x /= 10; while (qr) pc (qu[qr --]); }
	struct Flusher_ {~Flusher_(){flush();}}io_flusher_;
} using io::pc; using io::gc; using io::pstr; using io::gstr; using io::gi; using io::print;

// end fast read template by CYJian

#define iter(i, a, b) for(int i=(a); i<(b); i++)
#define rep(i, a) iter(i, 0, a)
#define rep1(i, a) iter(i, 1, (a)+1)
#define log(a) cerr<<"\033[32m[DEBUG] "<<#a<<'='<<(a)<<" @ line "<<__LINE__<<"\033[0m"<<endl
#define all(a) a.begin(), a.end()
#define fi first
#define se second
#define pb push_back
#define mp make_pair
 
using ll=long long;
using pii=pair<int, int>;
//#define int ll
constexpr uint64_t mod = (1ull<<61) - 1;
uint64_t modmul(uint64_t a, uint64_t b){
	uint64_t l1 = (uint32_t)a, h1 = a>>32, l2 = (uint32_t)b, h2 = b>>32;
	uint64_t l = l1*l2, m = l1*h2 + l2*h1, h = h1*h2;
	uint64_t ret = (l&mod) + (l>>61) + (h << 3) + (m >> 29) + (m << 35 >> 3) + 1;
	ret = (ret & mod) + (ret>>61);
	ret = (ret & mod) + (ret>>61);
	return ret-1;
}

bool s[200005];

int dp[200005];
uint64_t tosum[200005];
uint64_t wayfront[200005];
uint64_t wayback[200005];

signed main() {
    ios_base::sync_with_stdio(false); cin.tie(0);
    int n, k, c; gi(n), gi(k), gi(c);
	rep1(i, n) {
		char v; gc(v);
		while(v != 'x' && v != 'o') gc(v);
		s[i] = v == 'o';
	}
	int cpmax = 0, tmax = 0;
	rep1(i, n) {
		if(!s[i]) {
			cpmax = max(cpmax, dp[i-c]);
			continue;
		}
		if(i <= c) dp[i] = 1;
		else {
			dp[i] = cpmax+1;
			cpmax = max(cpmax, dp[i-c]);
		} 
		tmax = max(tmax, dp[i]);
	}
	if(tmax != k) return 0;
	tosum[0] = 1;
	rep1(i, n) {
		if(s[i]) wayfront[i] = tosum[dp[i]-1];
		if(i > c && dp[i-c]) {
			tosum[dp[i-c]] += wayfront[i-c];
			if(tosum[dp[i-c]] >= mod) tosum[dp[i-c]] -= mod;
		}
	}
	iter(j, n-c+1, n+1) {
		tosum[dp[j]] += wayfront[j];
		if(tosum[dp[j]] >= mod) tosum[dp[j]] -= mod;
	}
	wayfront[n+1] = tosum[tmax];
	memset(tosum, 0, sizeof tosum);
	tosum[tmax+1] = 1;
	for(int i=n; i>=1; i--) {
		if(s[i]) wayback[i] = tosum[dp[i]+1];
		if(i+c <= n && s[i+c]) {
			tosum[dp[i+c]] += wayback[i+c];
			if(tosum[dp[i+c]] >= mod) tosum[dp[i+c]] -= mod;
		}
	}
	rep1(i, n) {
		if(modmul(wayfront[i], wayback[i]) == wayfront[n+1]) {
			print(i); pc('\n');
		}
	}
}


Measured memory_bytes: 9728