#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = false;
//---------------------------------//

int main() {
	int N, K;
	cin >> N >> K;
	string S;
	cin >> S;
	vector<int> ans(N); // 0-lose, 1-win
	int top = 2 * N;
	int mn = INF; // 負けの最小
	for (int i = N - 1; i > 0; --i) {
		if (S[i - 1] == 'x') continue;
		if (top - i > K) mn = i;
		else ans[i] = mn - i <= K ? 1 : 0;
		
		if (ans[i] == 0) mn = i;
		top = i;
	}
	vector<int> ansv;
	FOR(i, 1, K + 1) if (S[i - 1] == 'o' && !ans[i]) ansv.emplace_back(i);
	if (ansv.empty()) ansv.emplace_back(0);
	
	for (int i : ansv) cout << i << '\n';
}