import java.util.*

fun main(args: Array<String>) {
    val (N, M) = readLine()!!.split(" ").map{it.toInt()}
    val S = readLine()!!.toCharArray()
    val safe = TreeSet<Int>()

    for (i in S.indices) {
        if (S[i] == '0') {
            safe.add(i)
        }
    }

    val steps = ArrayList<Int>()

    var p = N

    while (p > 0) {
        val q = safe.ceiling(p - M)!!
        if (p == q) {
            println(-1)
            return
        }
        steps.add(p - q)
        p = q
    }

    steps.reverse()
    println(steps.joinToString(" "))
}
