import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }




void main() {
  try {
    for (; ; ) {
      const N = readInt();
      const K = readInt();
      const S = "o" ~ readToken() ~ "x";
      
      auto dp = new int[N + 1];
      auto dpSum = new int[N + 2];
      foreach_reverse (n; 0 .. N + 1) {
        // [n + 1, n + K]
        const l = n + 1;
        const r = min(n + K, N) + 1;
        dp[n] = (S[n] == 'x' || dpSum[l] - dpSum[r] < r - l) ? 1 : 0;
        dpSum[n] = dp[n] + dpSum[n + 1];
      }
      debug {
        writeln("dp = ", dp);
      }
      
      if (dp[0]) {
        int[] ans;
        foreach (n; 1 .. min(K, N) + 1) {
          if (!dp[n]) {
            writeln(n);
          }
        }
      } else {
        writeln(0);
      }
    }
  } catch (EOFException e) {
  }
}