#include<bits/stdc++.h>

using namespace std;

int n, k, c;
string s;

int main()
{
	cin>>n>>k>>c>>s;
	vector<int> b(n, -1);
	int i = 0;
	for(int t = 0; t < k; t++)
	{
		while(s[i] == 'x') i++;
		b[i] = t;
		i += c + 1;
	}
	vector<int> dp(3 * n);
	for(int i = n; i--;)
	{
		dp[i] = dp[i + 1];
		if(s[i] == 'o') dp[i] = max(dp[i], dp[i + c + 1] + 1); 
	}
	for(int i = 0; i < n; i++) if(b[i] != -1 and b[i] + dp[i + 1] < k) cout<<i + 1<<endl;
	return 0;
}