#ifndef DEBUG
#  define NDEBUG
#endif
#include <iostream>
#include <algorithm>
#include <string>
#include <iterator>
#include <utility>
#include <type_traits>
#include <limits>
#include <cassert>
#include <numeric>
#include <vector>

using namespace std;

// template {{{
// misc {{{
using Z = long long;
[[maybe_unused]]
constexpr Z INF = numeric_limits<Z>::max() / 3;
// }}}

// debug {{{
template <class T>
using enable_if_sequence_t = enable_if_t<
  is_same<
    typename iterator_traits<
      typename remove_cv_t<remove_reference_t<T>>::iterator
    >::iterator_category,
    random_access_iterator_tag>{}>;
#ifdef NDEBUG
# define dump(x)
# define debug if (0)
template <class T>
inline T&& ix(T&& value) { return value; }
template <class T, class Index, class... Indices, class = enable_if_sequence_t<T>>
inline auto&& ix(T&& container, Index index, Indices... indices) {
  return ix(container[index], indices...);
}
#else
# define dump(x) do { \
    cerr << "\e[33m[dump: " << __LINE__ << "] " << (#x) << " = " << x << "\e[0m" << endl; \
  } while (0);
# define debug
template <class T>
inline auto&& ix_impl([[maybe_unused]] int line, [[maybe_unused]] const char* code, T&& value) {
  return value;
}
template <class T, class Index, class... Indices, class = enable_if_sequence_t<T>>
inline auto&& ix_impl(int line, const char* code, T&& container, Index index, Indices... indices) {
  if (index < 0) {
    cerr << "\e[31mix: negative index at line " << line << ", ix(" << code << ")\e[0m" << endl;
    exit(1);
  }
  int size = container.size();
  if (index >= size) {
    cerr << "\e[31mix: index out of range at line " << line << ", ix(" << code << ")\n"
      << "index = " << index << " whereas size = " << size << "\e[0m" << endl;
    exit(1);
  }
  return ix_impl(line, code, container[index], indices...);
}
#define ix(...) ix_impl(__LINE__, #__VA_ARGS__, __VA_ARGS__)
#endif
// }}}

// IO {{{
template <class T, class U>
ostream& operator<< (ostream& os, pair<T, U> p) {
  os << '(' << p.first << ", " << p.second << ')';
  return os;
}
template <class T, class U>
istream& operator>> (istream& is, pair<T, U>& p) {
  is >> p.first >> p.second;
  return is;
}
template <class T>
false_type is_container_impl(...);
template <class T, class = typename T::iterator>
true_type is_container_impl(T);
template <class T>
struct is_container : decltype(is_container_impl<T>(declval<T>())) {};
template <>
struct is_container <string> : std::false_type {};
template <class Container, class = enable_if_t<is_container<Container>{}>>
istream& operator>> (istream& is, Container& cont) {
  for (auto& v : cont) is >> v;
  return is;
}
template <class Container, class = enable_if_t<is_container<Container>{}>>
ostream& operator<< (ostream& os, Container const& cont) {
  bool first = true;
  constexpr char sep =
    is_container<typename Container::value_type>{} ? '\n' : ' ';
  for (auto const& v : cont) {
    if (!first) {
      os << sep;
    }
    first = false;
    os << v;
  }
  return os;
}
// }}}
// }}}


// segtree {{{
class segtree {
  private:
    int size;
    vector<Z> range, real;
    void update_impl(int left, int right, int node, int a, int b, Z x) {
      if (right <= a || b <= left) return;
      if (left <= a && b <= right) {
        ix(range, node) = min(ix(range, node), x);
        ix(real, node) = min(ix(real, node), x);
        return;
      }
      update_impl(left, right, 2 * node + 1, a, (a + b) / 2, x),
      update_impl(left, right, 2 * node + 2, (a + b) / 2, b, x);
      ix(real, node) = min(ix(real, 2 * node + 1), ix(real, 2 * node + 2));
    }
    Z query_impl(int left, int right, int node, int a, int b) const {
      if (right <= a || b <= left) return INF;
      if (left <= a && b <= right) return real[node];
      auto lv = query_impl(left, right, 2 * node + 1, a, (a + b) / 2),
           rv = query_impl(left, right, 2 * node + 2, (a + b) / 2, b);
      return min({lv, rv, ix(range, node)});
    }
  public:
    segtree(int n) {
      size = 1;
      while (size < n) size *= 2;
      range.resize(size * 2 - 1, INF);
      real.resize(size * 2 - 1, INF);
    }

    Z query(int left, int right) const {
      return query_impl(left, right, 0, 0, size);
    }

    void update(int left, int right, Z x) {
      update_impl(left, right, 0, 0, size, x);
    }
};
// }}}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.precision(10);
  cout << fixed;
  Z N, M;
  string S;
  cin >> N >> M >> S;
  segtree dists(N + 1), prev(N + 1);
  dists.update(0, 1, 0);
  for (auto i = 0; i < N; i++) {
    if (ix(S, i) == '1') continue;
    Z d = dists.query(i, i + 1);
    dump(i);
    dump(d);
    dists.update(i + 1, min(N, i + M) + 1, d + 1);
    prev.update(i + 1, min(N, i + M) + 1, i);
  }
  vector<Z> ans;
  Z pos = N;
  if (dists.query(N, N + 1) >= INF) {
    cout << -1 << endl;
    return 0;
  }
  while (pos != 0) {
    Z p = prev.query(pos, pos + 1);
    ans.push_back(pos - p);
    pos = p;
  }
  reverse(begin(ans), end(ans));
  cout << ans << endl;
}



Measured memory_bytes: 9672