import sys
input = sys.stdin.readline
N, K = map(int, input().split())
S = list(input())[: -1]
dp = [0] * (N + 1)

class FenwickTree:
  def __init__(self, n):
    self.n = n
    self.data = [0] * (n + 2)
  def sum(self, l, r):
    s = 0
    while l > 0:
      s -= self.data[l]
      l -= l & -l
    while r > 0:
      s += self.data[r]
      r -= r & -r
    return s
  def add(self, i, x):
    i += 1
    while i <= self.n:
      self.data[i] += x
      i += i & -i
  def lowerbound(self, s):
    x = 0
    y = 0
    for i in range(self.n.bit_length(), -1, -1):
      k = x + (1 << i)
      if k <= self.n and (y + self.data[k] < s):
        y += self.data[k]
        x += 1 << i
    return x + 1

fwk = FenwickTree(N)
fwk.add(N, 1)
dp[-1] = 1
if S[-1] == "x":
  dp[-2] = 1
  fwk.add(N - 1, 1)
for i in range(N - 2, -1, -1):
  if S[i - 1] == "x":
    dp[i] = 1
    fwk.add(i, 1)
    continue
  r = min(N, i + K)
  s = fwk.sum(i, r + 1)
  if s < r - i: dp[i] = 1
  fwk.add(i, dp[i])
f = 0
for i in range(1, K + 1):
  if dp[i] == 0:
    print(i)
    f = 1
if f == 0: print(0)