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

int main() {
  ios::sync_with_stdio(false);

  int N, K; { cin >> N >> K; }
  string S; { cin >> S; }

  queue<int> lque;
  vector<int> d(N); {
    for (int i = N - 1; ~i; --i) {
      while (lque.size() && i + K < lque.front()) lque.pop();
      if (i && S[i - 1] == 'x') continue;
      d[i] = lque.size() > 0;
      if (d[i] == 0) lque.push(i);
    }
  }

  if (d[0]) {
    for (; lque.size(); lque.pop()) cout << lque.front() << '\n';
  } else {
    cout << 0 << endl;
  }
}