#include<bits/stdc++.h>
using namespace std;

#define int long long
#define double long double
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n) for (int i = 1; i <= (n); i++)
#define all(x) (x).begin(), (x).end()
#define uniq(x) (x).erase(unique(all(x)), (x).end())
#define bit(n) (1LL << (n))
#define dump(x) cerr << #x " = " << (x) << endl
using vint=vector<int>;
using vvint=vector<vint>;
using pint=pair<int, int>;
using vpint=vector<pint>;
template<typename T> using priority_queue_rev=priority_queue<T, vector<T>, greater<T>>;
constexpr double pi = 3.1415926535897932384626433832795028L;
constexpr int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
constexpr int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int gcd(int a, int b) {
    while (b) { swap(a %= b, b); }
    return a;
}
int lcm(int a, int b) { return a / gcd(a, b) * b; }
template<typename T> void fin(T mes) {
    cout << mes << endl;
    exit(0);
}
template<typename T1, typename T2> bool chmax(T1 &a, const T2 &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
template<typename T1, typename T2> bool chmin(T1 &a, const T2 &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &rhs) {
    os << "(" << rhs.first << ", " << rhs.second << ")";
    return os;
}
template<typename T> ostream &operator<<(ostream &os, const vector<T> &rhs) {
    os << "{";
    for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {
        os << *itr << (next(itr) != rhs.end() ? ", " : "");
    }
    os << "}";
    return os;
}
struct setup {
    static constexpr int PREC = 20;
    setup() {
        cout << fixed << setprecision(PREC);
        cerr << fixed << setprecision(PREC);
    };
} setup;

template<typename T>
struct segment_tree {
    int n;
    T ZERO;
    std::vector<T> data;
    int get_size(int n_) const {
        int ret = 1;
        while (ret < n_) { ret <<= 1; }
        return ret;
    }
    segment_tree(int n_, T ZERO = T()) : n(get_size(n_)), ZERO(ZERO), data(n << 1, ZERO) {}
    template<typename I> segment_tree(I begin, I end, T ZERO = T())
        : n(get_size(end - begin)), ZERO(ZERO), data(n << 1) {
        std::copy(begin, end, data.begin() + n);
        for (int i = n - 1; i > 0; i--) { data[i] = data[i << 1] + data[(i << 1) + 1]; }
    }
    void set(int i, T x) {
        i += n;
        data[i] = x;
        while (i > 1) {
            i >>= 1;
            data[i] = data[i << 1] + data[(i << 1) + 1];
        }
    }
    T operator[](int i) const { return data[i + n]; }
    T get_sum(int l, int r) const {
        if (l < 0) { l = 0; }
        if (r > n) { r = n; }
        T ret = ZERO;
        for (l += n, r += n; l < r; l >>= 1, r >>= 1) {
            if (l & 1) { ret += data[l], l++; }
            if (r & 1) { ret += data[r - 1]; }
        }
        return ret;
    }
};

struct max_monoid {
    long long val;
    max_monoid() : val(LLONG_MIN) {}
    max_monoid(long long val) : val(val) {}
    bool operator==(const max_monoid &rhs) const { return val == rhs.val; }
    bool operator!=(const max_monoid &rhs) const { return std::rel_ops::operator!=(*this, rhs); }
    max_monoid &operator+=(const max_monoid &rhs) {
        val = std::max(val, rhs.val);
        return *this;
    }
    max_monoid operator+(const max_monoid rhs) const { return max_monoid(*this) += rhs; }
    friend std::istream &operator>>(std::istream &is, max_monoid &rhs) {
        long long v;
        is >> v;
        rhs = max_monoid(v);
        return is;
    }
    friend std::ostream &operator<<(std::ostream &os, const max_monoid &rhs) { return os << rhs.val; }
};

int N, M;
string S;
signed main() {
    cin >> N >> M >> S;
    int cnt = 0;
    for (int i = 1; i < N; i++) {
        if (S[i] == '1') { cnt++; }
        else { cnt = 0; }
        if (cnt >= M) { fin(-1); }
    }
    reverse(all(S));
    rep(i, M) { S += '1'; }
    segment_tree<max_monoid> rmq(N + 1 + M);
    rep(i, N + 1 + M) {
        if (S[i] == '0') { rmq.set(i, i); }
    }
    vint ans;
    int cur = 0;
    while (cur != N) {
        int next = rmq.get_sum(cur + 1, cur + M + 1).val;
        ans.push_back(next - cur);
        cur = next;
    }
    reverse(all(ans));
    rep(i, ans.size()) { cout << ans[i] << " "; }
    cout << endl;

}


Measured memory_bytes: 4612