#include <bits/stdc++.h>
//#include <chrono>
#pragma GCC optimize("O3")
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()

using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;

ll N,M,H,W,Q,K,A,B;
string S;
using P = pair<ll, ll>;
const ll INF = (1LL<<60);

template<class T> bool chmin(T &a, const T &b){
    if(a > b) {a = b; return true;}
    else return false;
}
template<class T> bool chmax(T &a, const T &b){
    if(a < b) {a = b; return true;}
    else return false;
}
template<class T> void my_printv(std::vector<T> v,bool endline = true){
    if(!v.empty()){
        for(std::size_t i{}; i<v.size()-1; ++i) std::cout<<v[i]<<" ";
        std::cout<<v.back();
    }
    if(endline) std::cout<<std::endl;
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cin>>N>>K>>S;
    vec ng(1 + N + K), sum(1 + N + K + 1, 0), yoi(N + K + 1, 0);
    ng[0] = 0;
    rep(i, N - 1) ng[i+1] = S[i] == 'x';
    reps(i, N, 1 + N + K) ng[i] = 1;
    Rrep(i, N + K + 1){
        if(ng[i] || sum[i+1] - sum[min(i + K + 1, N + K + 1)]){
            yoi[i] = 0;
        }else{
            yoi[i] = 1;
        }
        sum[i] = sum[i+1] + yoi[i];
    }
    vec ans(0);
    reps(i, 1, K + 1) if(yoi[i]) ans.push_back(i);
    /*
    reps(i, 1, N + K + 1) cout<<sum[i] - sum[min(i + K, N + K + 1)];
    cout<<endl;
    reps(i, 1, N + K + 1) cout<<yoi[i];
    cout<<endl;
     */
    if(ans.empty()) cout<<0<<endl;
    else for(ll e : ans) cout<<e<<endl;
}