#include <bits/stdc++.h>
using namespace std;
template <typename T>
struct binary_indexed_tree{
	int N;
	vector<T> BIT;
	binary_indexed_tree(int n){
		N = 1;
		while (N < n){
			N *= 2;
		}
		BIT = vector<T>(N + 1, 0);
	}
	void add(int i, T x){
		i++;
		while (i <= N){
			BIT[i] += x;
			i += i & -i;
		}
	}
	T sum(int i){
		T ans = 0;
		while (i > 0){
			ans += BIT[i];
			i -= i & -i;
		}
		return ans;
	}
	T sum(int L, int R){
		return sum(R) - sum(L);
	}
};
int main(){
  int N, K;
  cin >> N >> K;
  string S;
  cin >> S;
  vector<int> dp(N + 1, 0);
  binary_indexed_tree<int> BIT(N + 1);
  for (int i = N - 1; i >= 0; i--){
    bool ok = true;
    if (i != 0){
      if (S[i - 1] == 'x'){
        ok = false;
      }
    }
    if (ok){
      if (BIT.sum(i + 1, min(i + K, N) + 1) == 0){
        dp[i] = 1;
        BIT.add(i, 1);
      }
    }
  }
  if (dp[0] == 1){
    cout << 0 << endl;
  } else {
    for (int i = 1; i <= K; i++){
      if (dp[i] == 1){
        cout << i << endl;
      }
    }
  }
}