//#define NDEBUG
#include <algorithm>
#include <cstddef>
#include <cstdint>
#include <iostream>
#include <vector>

namespace n91 {

using i8 = std::int_fast8_t;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
using u8 = std::uint_fast8_t;
using u32 = std::uint_fast32_t;
using u64 = std::uint_fast64_t;
using isize = std::ptrdiff_t;
using usize = std::size_t;

struct rep {
  struct itr {
    usize i;
    constexpr itr(const usize i) noexcept : i(i) {}
    void operator++() noexcept { ++i; }
    constexpr usize operator*() const noexcept { return i; }
    constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
  };
  const itr f, l;
  constexpr rep(const usize f, const usize l) noexcept
      : f(std::min(f, l)), l(l) {}
  constexpr auto begin() const noexcept { return f; }
  constexpr auto end() const noexcept { return l; }
};
struct revrep {
  struct itr {
    usize i;
    constexpr itr(const usize i) noexcept : i(i) {}
    void operator++() noexcept { --i; }
    constexpr usize operator*() const noexcept { return i; }
    constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
  };
  const itr f, l;
  constexpr revrep(const usize f, const usize l) noexcept
      : f(l - 1), l(std::min(f, l) - 1) {}
  constexpr auto begin() const noexcept { return f; }
  constexpr auto end() const noexcept { return l; }
};
template <class T> auto md_vec(const usize n, const T &value) {
  return std::vector<T>(n, value);
}
template <class... Args> auto md_vec(const usize n, Args... args) {
  return std::vector<decltype(md_vec(args...))>(n, md_vec(args...));
}
template <class T> constexpr T difference(const T &a, const T &b) noexcept {
  return a < b ? b - a : a - b;
}
template <class T> void chmin(T &a, const T &b) noexcept {
  if (b < a)
    a = b;
}
template <class T> void chmax(T &a, const T &b) noexcept {
  if (a < b)
    a = b;
}
template <class T> T scan() {
  T ret;
  std::cin >> ret;
  return ret;
}

} // namespace n91
#include <cassert>
#include <stack>

namespace nimi {

template <class T, class Op> class queue_aggregation {
private:
  class node {
  public:
    T val, sum;
    node(const T &val, const T &sum) : val(val), sum(sum) {}
  };

  Op op;
  std::stack<node> front_stack, back_stack;

public:
  queue_aggregation(const Op &op = Op())
      : op(op), front_stack(), back_stack() {}

  bool empty() const { return front_stack.empty() && back_stack.empty(); }

  std::size_t size() const { return front_stack.size() + back_stack.size(); }

  T fold_all() const {
    assert(!empty());
    if (front_stack.empty()) {
      return back_stack.top().sum;
    } else if (back_stack.empty()) {
      return front_stack.top().sum;
    } else {
      return op(front_stack.top().sum, back_stack.top().sum);
    }
  }

  void push(const T &x) {
    if (back_stack.empty()) {
      back_stack.emplace(x, x);
    } else {
      T s{op(back_stack.top().sum, x)};
      back_stack.emplace(x, s);
    }
  }

  void pop() {
    assert(!empty());
    if (front_stack.empty()) {
      front_stack.emplace(back_stack.top().val, back_stack.top().val);
      back_stack.pop();
      while (!back_stack.empty()) {
        T s{op(back_stack.top().val, front_stack.top().sum)};
        front_stack.emplace(back_stack.top().val, s);
        back_stack.pop();
      }
    }
    front_stack.pop();
  }
};

} // namespace nimi
#include <algorithm>
#include <iostream>
#include <limits>
#include <utility>

namespace n91 {

void main_() {
  /*
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  //*/
  const usize n = scan<usize>();
  const usize m = scan<usize>();
  const std::string s = scan<std::string>();
  struct node {
    usize step;
    usize idx;
  };
  const auto f = [](const node &l, const node &r) {
    return l.step < r.step ? l : r;
  };
  nimi::queue_aggregation<node, decltype(f)> qa(f);
  std::vector<usize> next(n + 1);
  qa.push({0, n});
  constexpr usize Inf = std::numeric_limits<usize>::max() / 2;
  usize ans;
  for (const usize i : revrep(0, n)) {
    if (qa.size() > m) {
      qa.pop();
    }
    const node t = qa.fold_all();
    next[i] = t.idx;
    if (i == 0) {
      ans = t.step + 1;
    }
    if (s[i] == '0') {
      qa.push({t.step + 1, i});
    } else {
      qa.push({Inf, i});
    }
  }
  if (ans >= Inf) {
    std::cout << "-1" << std::endl;
    return;
  }
  usize p = 0;
  while (p != n) {
    std::cout << next[p] - p << ' ';
    p = next[p];
  }
}

} // namespace n91

int main() {
  n91::main_();
  return 0;
}


Measured memory_bytes: 4352