/**
 * code generated by JHelper
 * More info: https://github.com/AlexeyDmitriev/JHelper
 * @author zjsdut
 */

#include <iostream>
#include <iomanip>
#include <vector>
struct fast_ios {
  fast_ios() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);
    std::cout << std::fixed << std::setprecision(10);
  };
} fast_ios_;

template <typename A, typename B> bool chkmin(A &a, const B &b) {
  if (b < a) {
    a = b;
    return true;
  }
  return false;
}

template <typename A, typename B> bool chkmax(A &a, const B &b) {
  if (b > a) {
    a = b;
    return true;
  }
  return false;
}

template <typename T> std::istream &operator>>(std::istream &stream, std::vector<T> &vec) {
  for (auto &x : vec)
    stream >> x;
  return stream;
}

void scan() {}

template <class T, class... Args> void scan(T &a, Args &... rest) {
  std::cin >> a;
  scan(rest...);
}

using ll = long long;
using vl = std::vector<ll>;
using vb = std::vector<bool>;
using vi = std::vector<int>;
using pii = std::pair<int, int>;
template <typename T> using vv = std::vector<std::vector<T>>;
#define rng(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define up(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define down(i, b, a) for (int i = int(b); i >= int(a); i--)
#define TOKENPASTE(x, y) x##y
#define TOKENPASTE2(x, y) TOKENPASTE(x, y)
#define rep(n)                                                                 \
  for (int TOKENPASTE2(_iter_, __LINE__) = 0,                                  \
                               TOKENPASTE2(_num_, __LINE__) = (int)(n);        \
       TOKENPASTE2(_iter_, __LINE__) < TOKENPASTE2(_num_, __LINE__);           \
       ++TOKENPASTE2(_iter_, __LINE__))
#define FOR(x, cont) for (const auto &x : cont)
#define For(x, cont) for (auto &x : cont)
#define all(x) begin(x), end(x)
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ep emplace
#define SZ(x) (int)(x).size()
#define UNIQ(vec) (vec).erase(unique(all(vec)), end(vec))
#define LB(cont, x) int(lower_bound(all(cont), x) - begin(cont))
#define UB(cont, x) int(upper_bound(all(cont), x) - begin(cont))

template <typename T>
std::ostream &operator<<(std::ostream &stream, const std::vector<T> &vec) {
  if (!vec.empty()) {
    stream << vec[0];
    for (size_t i = 1; i != vec.size(); ++i)
      stream << ' ' << vec[i];
  }
  return stream;
}

template <typename T> void print(const std::vector<T> &t) { std::cout << t << '\n'; }

template <typename T> void print(const std::vector<std::vector<T>> &t) {
  for (const auto &row : t) {
    print(row);
  }
}

template <typename T> void print(const T &t) { std::cout << t << ' '; }

template <typename T, typename... Args>
void print(const T &t, const Args &... rest) {
  print(t);
  print(rest...);
}

template <typename T> void println(const T &t) { std::cout << t << '\n'; }

template <typename T, typename... Args>
void println(const T &t, const Args &... rest) {
  print(t);
  println(rest...);
}
#include <bits/stdc++.h>

using namespace std;
// debug code by tourist
std::string to_string(const std::string &s) { return '"' + s + '"'; }

std::string to_string(const char *s) { return to_string((std::string)s); }

std::string to_string(bool b) { return (b ? "true" : "false"); }

template <typename A, typename B> std::string to_string(const std::pair<A, B>& p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}

template <typename A> std::string to_string(const A& v) {
  bool first = true;
  std::string res = "{";
  for (const auto &x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}

void debug_out() { std::cerr << std::endl; }

template <typename Head, typename... Tail> void debug_out(const Head& H, const Tail&... T) {
  std::cerr << " " << to_string(H);
  debug_out(T...);
}

#if defined LOCAL
#define debug(...) std::cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

using namespace std;

class EYutori {
  static void SOLVE() {
    // dp1[j] + dp2[k] >= K
    // j + c < k
    // j < i < k
    int n, k, c;
    string s;
    scan(n, k, c, s);
    // c == 0 特判
    if (c == 0) {
      int cnt = 0;
      FOR (x, s) cnt += x == 'o';
      if (cnt == k) {
        rng (i, 0, n) {
          if (s[i] == 'o') {
            println(i + 1);
          }
        }
      }
      return;
    }
    vi dp2(n);
    dp2[n - 1] = s[n - 1] == 'o';
    down(i, n - 2, 0) {
      if (s[i] == 'x') {
        dp2[i] = dp2[i + 1];
      } else {
        dp2[i] = 1;
        if (i + c + 1 < n) {
          dp2[i] += dp2[i + c + 1];
        }
        chkmax(dp2[i], dp2[i + 1]);
      }
    }

    vi dp1(n);
    dp1[0] = s[0] == 'o';
    rng(i, 1, n) {
      if (s[i] == 'x') {
        dp1[i] = dp1[i - 1];
      } else {
        if (i - c - 1 >= 0) {
          dp1[i] = max(dp1[i - 1], dp1[i - c - 1] + 1);
        } else {
          dp1[i] = 1;
        }
      }
    }
    vb skip(n);
    vi cnt(n + 1);
    rng(i, 0, n - 1) {
      if (dp2[i + 1] >= k) {
        skip[i] = true;
      }
    }
    down(i, n - 1, 1) {
      if (dp1[i - 1] >= k) {
        skip[i] = true;
      }
    }

    rng(i, 0, n) {
      // 若 c == 0 是不能这样判断。
      if (dp1[i] > 0 && i + c + 1 < n && dp1[i] + dp2[i + c + 1] >= k) {
        cnt[i + 1] += 1;
        cnt[i + c + 1] -= 1;
      }
    }
    for (int i = 1; i < n; ++i) {
      cnt[i] += cnt[i - 1];
      if (cnt[i] > 0) {
        skip[i] = true;
      }
    }
    rng(i, 0, n) {
      if (s[i] == 'o' && !skip[i]) {
        println(i + 1);
      }
    }
  }

public:
  static void solve(std::istream &in, std::ostream &out) {
    auto cin_buff = std::cin.rdbuf(in.rdbuf());
    auto cerr_buff = std::cerr.rdbuf(cout.rdbuf(out.rdbuf()));
    SOLVE();
    std::cout.rdbuf(cerr.rdbuf(cerr_buff));
    std::cin.rdbuf(cin_buff);
  }
};


int main() {
  EYutori solver;
  std::istream& in(std::cin);
  std::ostream& out(std::cout);
  solver.solve(in, out);
  return 0;
}


Measured memory_bytes: 2964