//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")
   
//#include <x86intrin.h>
#include <bits/stdc++.h>   
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
using namespace __gnu_pbds;
using namespace std;

template<typename T> using ordered_set = tree <T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
     
#define F first
#define S second           
#define lb lower_bound               
#define ub upper_bound
#define pb push_back
#define pf push_front    
#define ppb pop_back
#define mp make_pair
#define bpp __builtin_popcountll                                                                                        
#define sqr(x) ((x) * (x)) 
#define al 0x3F3F3F3F
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define in insert
#define ppf pop_front
#define endl '\n'
//#define int long long
 
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef pair <int, int> pii;
 
const int mod = (int)1e9 + 7;
const int N = (int)3e5 + 123;
const ll inf = (ll)1e18 + 1;

const double pi = acos (-1.0);
const double eps = 1e-7;                  
const int dx[] = {0, 0, 1, 0, -1};
const int dy[] = {0, 1, 0, -1, 0};

int n, m, dp[N], p[N];  
string s;
pii t[4 * N];
vector <int> ans;

void build (int v = 1, int tl = 0, int tr = n) {
   if (tl == tr) {
      if (tl == 0) t[v].F = 0;
      else t[v].F = mod;
      t[v].S = tl;
      return;
   }
   int tm = tl + tr >> 1;
   build (v + v, tl, tm);
   build (v + v + 1, tm + 1, tr);
   t[v] = min (t[v + v], t[v + v + 1]);
}

void upd (int pos, int val, int v = 1, int tl = 0, int tr = n) {
   if (tl == tr) {
      t[v].F = val;
      return;
   }
   int tm = tl + tr >> 1;
   if (pos <= tm) upd (pos, val, v + v, tl, tm);
   else upd (pos, val, v + v + 1, tm + 1, tr);
   t[v] = min (t[v + v], t[v + v + 1]);
}

pii get (int l, int r, int v = 1, int tl = 0, int tr = n) {
   if (tl > r || tr < l) return mp (mod, mod);
   if (l <= tl && tr <= r) return t[v];
   int tm = tl + tr >> 1;
   return min (get (l, r, v + v, tl, tm), get (l, r, v + v + 1, tm + 1, tr));
}

inline void boost () {                    
   ios_base :: sync_with_stdio (NULL);
   cin.tie (NULL), cout.tie (NULL);          
}                                                     

inline void Solve () {
   cin >> n >> m;
   cin >> s;
   build ();
   dp[0] = 0;
   for (int i = 1; i <= n; i ++) {
      if (s[i] == '1') {
         dp[i] = mod;
         upd (i, mod);
         continue;
      }
      pii res = get ((i - m < 0 ? 0 : i - m), i);
      if (res.F == mod) {
         dp[i] = mod;
         upd (i, mod);
         continue;
      }
      dp[i] = res.F + 1;
      p[i] = res.S;
      upd (i, dp[i]);
   }
   if (dp[n] == mod) cout << -1, exit (0); 
   vector <int> ans;
   int x = n;
   while (x) {
      ans.pb (x - p[x]);
      x = p[x];
   }
   reverse (all (ans));
   for (auto it : ans) cout << it << ' ';
}

main () {                                       
// freopen (".in", "r", stdin);    
// freopen (".out", "w", stdout);              
   boost ();
   int tt = 1;
   //cin >> tt;   
   while (tt --) {
      Solve ();
   }                                               
   return 0;      
}
                          

Measured memory_bytes: 7624