#define LOCAL
#define _USE_MATH_DEFINES
#include <array>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <complex>
#include <cmath>
#include <numeric>
#include <bitset>
#include <functional>
#include <random>
#include <ctime>

using namespace std;

template <typename A, typename B>
ostream& operator <<(ostream& out, const pair<A, B>& a) {
  out << "(" << a.first << "," << a.second << ")";
  return out;
}
template <typename T, size_t N>
ostream& operator <<(ostream& out, const array<T, N>& a) {
  out << "["; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T>
ostream& operator <<(ostream& out, const vector<T>& a) {
  out << "["; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T, class Cmp>
ostream& operator <<(ostream& out, const set<T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "}";
  return out;
}
template <typename U, typename T, class Cmp>
ostream& operator <<(ostream& out, const map<U, T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& p : a) { out << (first ? "" : ", "); out << p.first << ":" << p.second; first = 0;} out << "}";
  return out;
}
#ifdef LOCAL
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
#else
#define trace(...) 42
#endif
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
  cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
  const char* comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << ": " << arg1 << " |";
  __f(comma + 1, args...);
}

typedef long long int64;
typedef pair<int, int> ii;
const int INF = 1 << 29;
const int MOD = 1e9 + 7;
mt19937 mrand(random_device{}());
int rnd(int x) { return mrand() % x; }

struct fast_ios {
  fast_ios() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
  };
} fast_ios_;

const int N = 2e5 + 10;
char s[N];

int main() {
  int n, m, c;
  scanf("%d%d%d", &n, &m, &c);
  scanf("%s", s);
  vector<ii> L(n), R(n);
  L[0] = s[0] == 'o' ? ii{1, 0} : ii{0, -INF};
  for (int i = 1; i < n; ++i) {
    if (s[i] == 'x' || i - L[i - 1].second <= c) {
      L[i] = L[i - 1];
    } else {
      L[i] = ii{L[i - 1].first + 1, i};
    }
  }
  R[n - 1] = s[n - 1] == 'o' ? ii{1, n - 1} : ii{0, INF};
  for (int i = n - 2; i >= 0; --i) {
    if (s[i] == 'x' || R[i + 1].second - i <= c) {
      R[i] = R[i + 1];
    } else {
      R[i] = ii{R[i + 1].first + 1, i};
    }
  }
  for (int i = 0; i < n; ++i) {
    if (s[i] == 'x') continue;
    int cnt = i - 1 >= 0 ? L[i - 1].first : 0;
    cnt += i + 1 < n ? R[i + 1].first : 0;
    if (i - 1 >= 0 && i + 1 < n && R[i + 1].second - L[i - 1].second <= c) --cnt;
    if (cnt < m) printf("%d\n", i + 1);
  }
  return 0;
}


Measured memory_bytes: 4864