#include<iostream>
#include<string>
#include<cstring>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
using ll = long long;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;
const ll mod=998244353 ;
#define PI 3.141592653589793


int main(){
  int n, k; cin >> n >> k; string s; cin >> s; s+='x';
  int gru[n] = {};
  int begin;
  for(int i=n-1; i>=0; i--){
    if(s[i]=='o'){
      begin = i; break;
    }
  }
  //cout << begin << endl;
  for(int i=begin-1; i>=0; i--){
    if(s[i]=='x' || gru[i+1]<k) gru[i] = gru[i+1]+1;
    else gru[i] = 0;
  }
  vector<int> ans;
  rep(i, k){
    if(s[i]=='o' && gru[i]==0) ans.push_back(i+1);
  }
  //rep(i, n){
    //cout << gru[i];
  //}
  //cout << endl;
  if(ans.size()==0){
    cout << 0 << endl; return 0;
  }
  //cout << endl;
  for(auto k: ans){
    cout << k << endl;
  }
}