#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n, k; cin >> n >> k;
    string s; cin >> s;
    vector<bool> ok(n, false);
    vector<int> ans;
    if(s[n-2] == 'o') {
        ok[n-1] = true;
        if(n-1 <= k) ans.push_back(n-1);
    }
    int ok_sum = (ok[n-1] ? 1 : 0);
    int r = n-1;
    for(int i = n-2; i >= 1; i--){
        while(r > i+k){
            if(ok[r]) ok_sum--;
            r--;
        }
        if(s[i-1] == 'x') continue;
        if(ok_sum == 0){
            ok[i] = true;
            ok_sum++;
            if(i <= k) ans.push_back(i);
        }else{
            assert(ok_sum > 0);
        }
    }
    if(ans.empty()){
        cout << 0 << endl;
    }else{
        for(int i : ans) cout << i <<  endl;
    }
}