#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, ll> pil;
typedef pair<ll, int> pli;
typedef pair<double,double> pdd;
#define SQ(i) ((i)*(i))
#define MEM(a, b) memset(a, (b), sizeof(a))
#define SZ(i) int(i.size())
#define FOR(i, j, k, in) for (int i=j ; i<(k) ; i+=in)
#define RFOR(i, j, k, in) for (int i=j ; i>=(k) ; i-=in)
#define REP(i, j) FOR(i, 0, j, 1)
#define REP1(i,j) FOR(i, 1, j+1, 1)
#define RREP(i, j) RFOR(i, j, 0, 1)
#define ALL(_a) _a.begin(),_a.end()
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define X first
#define Y second
#ifdef tmd
#define TIME(i) Timer i(#i)
#define debug(...) do{\
    fprintf(stderr,"%s - %d (%s) = ",__PRETTY_FUNCTION__,__LINE__,#__VA_ARGS__);\
    _do(__VA_ARGS__);\
}while(0)
template<typename T>void _do(T &&_x){cerr<<_x<<endl;}
template<typename T,typename ...S> void _do(T &&_x,S &&..._t){cerr<<_x<<" ,";_do(_t...);}
template<typename _a,typename _b> ostream& operator << (ostream &_s,const pair<_a,_b> &_p){return _s<<"("<<_p.X<<","<<_p.Y<<")";}
template<typename It> ostream& _OUTC(ostream &_s,It _ita,It _itb)
{
    _s<<"{";
    for(It _it=_ita;_it!=_itb;_it++)
    {
        _s<<(_it==_ita?"":",")<<*_it;
    }
    _s<<"}";
    return _s;
}
template<typename _a> ostream &operator << (ostream &_s,vector<_a> &_c){return _OUTC(_s,ALL(_c));}
template<typename _a> ostream &operator << (ostream &_s,set<_a> &_c){return _OUTC(_s,ALL(_c));}
template<typename _a> ostream &operator << (ostream &_s,deque<_a> &_c){return _OUTC(_s,ALL(_c));}
template<typename _a,typename _b> ostream &operator << (ostream &_s,map<_a,_b> &_c){return _OUTC(_s,ALL(_c));}
template<typename _t> void pary(_t _a,_t _b){_OUTC(cerr,_a,_b);cerr<<endl;}
#define IOS()
class Timer {
private:
    string scope_name;
    chrono::high_resolution_clock::time_point start_time;
public:
    Timer (string name) : scope_name(name) {
        start_time = chrono::high_resolution_clock::now();
    }
    ~Timer () {
        auto stop_time = chrono::high_resolution_clock::now();
        auto length = chrono::duration_cast<chrono::microseconds>(stop_time - start_time).count();
        double mlength = double(length) * 0.001;
        debug(scope_name, mlength);
    }
};
#else
#define TIME(i)
#define debug(...)
#define pary(...)
#define endl '\n'
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0)
#endif

const ll MOD = 1000000007;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const int iNF = 0x3f3f3f3f;
const ll MAXN = 100005;

int n, m;
string gg;

int tr[MAXN], dp[MAXN];
int deq[MAXN], fr, bk;
/********** Good Luck :) **********/
int main () {
    TIME(main);
    IOS();

#ifdef tdmd
    n = 100000, m = 3;
    gg = string(n+1, '0');
    REP1 (i, n-1) {
        if (rand()%2 == 1) {
            gg[i] = '1';
        }
    }
#else
    cin >> n >> m;
    cin >> gg;
#endif

    dp[n] = 0;

    deq[bk++] = n;
    for (int i=n-1; i>=0; i--) {
        if (gg[i]=='0') {
            while(bk-fr > 0 && deq[fr]-i>m) {
                fr++;
            }
            if (bk-fr > 0) {
                dp[i] = dp[deq[fr]] + 1;
                tr[i] = deq[fr];
            } else {
                dp[i] = -1;
            }
            while (bk-fr > 0 && dp[deq[bk-1]] >= dp[i]) {
                bk--;
            }

            if (dp[i] != -1) {
                deq[bk++] = i;
            }
        }
    }

    if (dp[0] == -1) {
        cout << -1 << endl;
    } else {
        int x=  0;
        vector<int> ans;
        while (x != n) {
            assert(dp[x] != -1);
            ans.eb(tr[x] - x);
            x = tr[x];
        }

        REP (i, SZ(ans)) {
            cout << ans[i] << " \n"[i==SZ(ans)-1];
        }

    }
    return 0;
}


Measured memory_bytes: 2248