#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ll long long
//increase stack size
#pragma comment(linker, "/STACK:16777216")

ll mxm() {return LLONG_MIN;}
template<typename... Args>
ll mxm(ll a, Args... args) { return max(a,mxm(args...)); }

ll mnm() {return LLONG_MAX;}
template<typename... Args>
ll mnm(ll a, Args... args) { return min(a,mnm(args...)); }

template<class T> ostream& operator<<(ostream& os,vector<T> V){
	os<<"[ ";for(auto v:V)os<<v<<" ";return os<<"]";
}
template<class L,class R> ostream& operator<<(ostream& os,pair<L,R> P){
	return os<<"("<<P.first<<","<<P.second<<")";
}

#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__,__VA_ARGS__)
template<typename Arg1>
void __f(const char* name,Arg1&& arg1){
	cout<<name<<" : "<<arg1<<endl;
}
template <typename Arg1,typename... Args>
void __f(const char* names,Arg1&& arg1,Args&&... args){
	const char* comma=strchr(names+1,',');cout.write(names,comma-names)<<" : "<<arg1<<" | ";__f(comma+1,args...);
}
#else
#define trace(...) 1
#endif

#define ld long double
#define pll pair<ll,ll>
#define ii pair<int,int>
#define vll vector<ll>
#define vii vector<ii>
#define vi vector<int>
#define vpll vector<pll>
#define vld vector<ld>
#define vvld vector<vld>
#define vvi vector<vi>
#define vvll vector<vll>
#define vvpll vector<vpll>
#define vvii vector<vii>
#define I insert
#define F first
#define S second
#define pb push_back
#define endl "\n"
#define all(x)	x.begin(),x.end()

const int mod=1e9+7;
// 128 bit: __int128
inline int add(int a,int b){a+=b;if(a>=mod)a-=mod;return a;}
inline int sub(int a,int b){a-=b;if(a<0)a+=mod;return a;}
inline int mul(int a,int b){return (a*1ll*b)%mod;}
inline int power(int a,int b){int rt=1;while(b>0){if(b&1)rt=mul(rt,a);a=mul(a,a);b>>=1;}return rt;}
inline int inv(int a){return power(a,mod-2);}

struct compare{
	bool operator() (const int &a,const int &b) const{
		return a>b;
	}
};

int main()
{
	ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);cout<<setprecision(25);
	ll n, k, c;
	cin >> n >> k >> c;
	string s;
	cin >> s;
	vll mfow(n), mback(n), prev(n, -1), nx(n, -1), prevk(n, -1), nxk(n, -1);
	ll lst = -1;
	for(ll i = 0; i < n; i++){
		if(i - c - 1 >= 0)
			prevk[i] = prev[i - c - 1];
		if(s[i] == 'o')
			lst = i;
		prev[i] = lst;
	}
	lst = -1;
	for(ll i = n - 1; i >= 0; i--){
		if(i + c + 1 < n)
			nxk[i] = nx[i + c + 1];
		if(s[i] == 'o')
			lst = i;
		nx[i] = lst;
	}
	for(ll i = 0; i < n; i++){
		if(s[i] == 'o'){
			mback[i] = max(i == 0 ? 0 : mback[i - 1], 1 + (i - c - 1 < 0 ? 0 : mback[i - c - 1]));
		}
		else mback[i] = (i == 0 ? 0 : mback[i - 1]);
	}
	for(ll i = n - 1; i >= 0; i--){
		if(s[i] == 'o'){
			mfow[i] = max(i == n - 1 ? 0 : mfow[i + 1], 1 + (i + c + 1 >= n ? 0 : mfow[i + c + 1]));
		}
		else mfow[i] = (i == n - 1 ? 0 : mfow[i + 1]);
	}
	for(ll i = 0; i < n; i++){
		if(s[i] == 'x')
			continue;
		if(i - 1 >= 0 && mback[i - 1] == mback[i])
			continue;
		ll a = i - 1, b = (i + 1 < n ? nx[i + 1] : -1), tot = mback[i] - 1;
		// if(a > -1)
		// 	tot += mback[a];
		if(b > -1)
			tot += mfow[b];
		if(tot >= k)
			continue;
		cout << i + 1 << endl;
	}
}

Measured memory_bytes: 11284