#include <algorithm>
#include <iomanip>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <list>
#include <string>
#include <sstream>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <numeric>
#include <vector>
#include <climits>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
#define GET_MACRO(_1, _2, _3, NAME, ...) NAME
#define _rep(i, n) _rep2(i, 0, n)
#define _rep2(i, a, b) for(int i = (int)(a); i < (int)(b); i++)
#define rep(...) GET_MACRO(__VA_ARGS__, _rep2, _rep)(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using i64 = long long;
template<class T, class U>
bool chmin(T& a, const U& b) { return (b < a) ? (a = b, true) : false; }
template<class T, class U>
bool chmax(T& a, const U& b) { return (b > a) ? (a = b, true) : false; }

template<typename T>istream& operator>>(istream&i,vector<T>&v){rep(j,v.size())i>>v[j];return i;}
template<typename T>string join(vector<T>&v){stringstream s;rep(i,v.size())s<<' '<<v[i];return s.str().substr(1);}
template<typename T>ostream& operator<<(ostream&o,vector<T>&v){if(v.size())o<<join(v);return o;}
template<typename T>string join(vector<vector<T>>&vv){string s="\n";rep(i,vv.size())s+=join(vv[i])+"\n";return s;}
template<typename T>ostream& operator<<(ostream&o,vector<vector<T>>&vv){if(vv.size())o<<join(vv);return o;}
template<class T> using pq = priority_queue<T, vector<T>, greater<T>>;

int n, k;
string s;
int op(int a, int b) {
    return min(a, b);
}

int e() {
    return int(1e9);
}


int main() {

    cin >> n >> k >> s;

    segtree<int, op, e> seg(n);
    rep(i, n) seg.set(i, 0);

    rep(i, n - 1) if(s[i] == 'x') seg.set(i + 1, 1);

    // rep(i, n) {
    //     cout << "i : " << i << " " << seg.get(i) << endl;
    // }

    for(int i = n - 1; i >= 1; i--) {
        if(s[i - 1] == 'x') continue;
        int left = i + 1;
        int right = i + k + 1;
        chmin(right, n);
        // if(left >= right) continue;
        int ret = seg.prod(left, right);
        if(ret == 0) seg.set(i, 1);
        else seg.set(i, 0);
    }


    vector<int> ans;
    rep(i, 1, k + 1) {
        if(seg.get(i) == 0) ans.push_back(i);
    }

    if(ans.size()) for(auto i : ans) cout << i << endl;
    else cout << 0 << endl;


    return 0;
}