#define MOD_TYPE 2

#pragma region Macros

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

#if 0
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
using Int = boost::multiprecision::cpp_int;
using lld = boost::multiprecision::cpp_dec_float_100;
#endif
#if 1
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif
using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
template <typename Q_type>
using smaller_queue = priority_queue<Q_type, vector<Q_type>, greater<Q_type>>;

constexpr ll MOD = (MOD_TYPE == 1 ? (ll)(1e9 + 7) : 998244353);
constexpr int INF = (int)1e9 + 10;
constexpr ll LINF = (ll)4e18;
constexpr double PI = acos(-1.0);
constexpr double EPS = 1e-7;
constexpr int Dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0};
constexpr int Dy[] = {1, -1, 0, 0, -1, -1, 1, 1, 0};

#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define REPI(i, m, n) for (int i = m; i < (int)(n); ++i)
#define repi(i, n) REPI(i, 0, n)
#define MP make_pair
#define MT make_tuple
#define YES(n) cout << ((n) ? "YES" : "NO") << "\n"
#define Yes(n) cout << ((n) ? "Yes" : "No") << "\n"
#define possible(n) cout << ((n) ? "possible" : "impossible") << "\n"
#define Possible(n) cout << ((n) ? "Possible" : "Impossible") << "\n"
#define all(v) v.begin(), v.end()
#define NP(v) next_permutation(all(v))
#define dbg(x) cerr << #x << ":" << x << "\n";

struct io_init
{
  io_init()
  {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << setprecision(30) << setiosflags(ios::fixed);
  };
} io_init;
template <typename T>
inline bool chmin(T &a, T b)
{
  if (a > b)
  {
    a = b;
    return true;
  }
  return false;
}
template <typename T>
inline bool chmax(T &a, T b)
{
  if (a < b)
  {
    a = b;
    return true;
  }
  return false;
}
inline ll CEIL(ll a, ll b)
{
  return (a + b - 1) / b;
}
template <typename A, size_t N, typename T>
inline void Fill(A (&array)[N], const T &val)
{
  fill((T *)array, (T *)(array + N), val);
}
template <typename T, typename U>
constexpr istream &operator>>(istream &is, pair<T, U> &p) noexcept
{
  is >> p.first >> p.second;
  return is;
}
template <typename T, typename U>
constexpr ostream &operator<<(ostream &os, pair<T, U> &p) noexcept
{
  os << p.first << " " << p.second;
  return os;
}
#pragma endregion

template <typename T>
struct SegmentTree
{
  using Fn = function<T(T, T)>;
  int N;
  vector<T> dat;
  T ti;
  Fn f;

  SegmentTree() {}
  SegmentTree(int n, Fn f, T ti) : f(f), ti(ti)
  {
    N = 1;
    while (N < n)
      N *= 2;
    dat.assign(2 * N - 1, ti);
  }
  SegmentTree(const vector<T> &v, Fn f, T ti) : f(f), ti(ti)
  {
    N = 1;
    int sz = v.size();
    while (N < sz)
      N *= 2;
    dat.resize(2 * N - 1);
    for (int i = 0; i < N; ++i)
      dat[i + N - 1] = (i < sz ? v[i] : ti);
    for (int i = N - 2; i >= 0; --i)
      dat[i] = f(dat[i * 2 + 1], dat[i * 2 + 2]);
  }

  void update(int k, T a)
  {
    k += N - 1;
    dat[k] = a;
    while (k > 0)
    {
      k = (k - 1) / 2;
      dat[k] = f(dat[k * 2 + 1], dat[k * 2 + 2]);
    }
  }

  T get(int k) { return dat[k + N - 1]; }

  void add(int k, T a) { update(k, f(get(k), a)); }

  T query(int l, int r)
  {
    T vl = ti, vr = ti;
    for (l += (N - 1), r += (N - 1); l < r; l >>= 1, r >>= 1)
    {
      if ((l & 1) == 0)
        vl = f(vl, dat[l]);
      if ((r & 1) == 0)
        vr = f(vr, dat[--r]);
    }
    return f(vl, vr);
  }
  T query_all() { return dat[0]; }

  void display()
  {
    for (int i = 0; i < N; i++)
      cerr << get(i) << " ";
    cerr << "\n";
  }
};

void solve()
{
  int n, k;
  string s;
  cin >> n >> k >> s;
  vector<int> v;
  auto f = [](bool a, bool b) { return a and b; };
  SegmentTree<bool> sg(n, f, true);
  sg.update(n - 1, true);
  for (int i = n - 2; i >= 0; i--)
  {
    if (s[i] == 'x')
    {
      sg.update(i, true);
      continue;
    }
    bool b = !sg.query(i + 1, min(n, i + k + 1));
    sg.update(i, b);
  }
  int cnt = 0;
  rep(i, k)
  {
    if (!sg.get(i) and s[i] == 'o')
      cout << i + 1 << "\n", cnt++;
  }
  if (cnt == 0)
    cout << 0 << "\n";
}

int main()
{

  solve();
}