#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
#include<chrono>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
//ll mod = 1;
constexpr ll mod = 998244353;
//constexpr ll mod = 1000000009;
const int mod17 = 1000000007;
const ll INF = (ll)mod17 * mod17;
typedef pair<int, int>P;

#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;

using ld = double;
typedef pair<ld, ld> LDP;
const ld eps = 1e-10;
const ld pi = acosl(-1.0);

template<typename T>
void chmin(T& a, T b) {
	a = min(a, b);
}
template<typename T>
void chmax(T& a, T b) {
	a = max(a, b);
}
template<typename T>
vector<T> vmerge(vector<T>& a, vector<T>& b) {
	vector<T> res;
	int ida = 0, idb = 0;
	while (ida < a.size() || idb < b.size()) {
		if (idb == b.size()) {
			res.push_back(a[ida]); ida++;
		}
		else if (ida == a.size()) {
			res.push_back(b[idb]); idb++;
		}
		else {
			if (a[ida] < b[idb]) {
				res.push_back(a[ida]); ida++;
			}
			else {
				res.push_back(b[idb]); idb++;
			}
		}
	}
	return res;
}
template<typename T>
void cinarray(vector<T>& v) {
	rep(i, v.size())cin >> v[i];
}
template<typename T>
void coutarray(vector<T>& v) {
	rep(i, v.size()) {
		if (i > 0)cout << " "; cout << v[i];
	}
	cout << "\n";
}
ll mod_pow(ll x, ll n, ll m = mod) {
	if (n < 0) {
		ll res = mod_pow(x, -n, m);
		return mod_pow(res, m - 2, m);
	}
	if (abs(x) >= m)x %= m;
	if (x < 0)x += m;
	//if (x == 0)return 0;
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
//mod should be <2^31
struct modint {
	int n;
	modint() :n(0) { ; }
	modint(ll m) {
		if (m < 0 || mod <= m) {
			m %= mod; if (m < 0)m += mod;
		}
		n = m;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
bool operator<(modint a, modint b) { return a.n < b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= (int)mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += (int)mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 20;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}
modint combP(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[a - b];
}

ll gcd(ll a, ll b) {
	a = abs(a); b = abs(b);
	if (a < b)swap(a, b);
	while (b) {
		ll r = a % b; a = b; b = r;
	}
	return a;
}
template<typename T>
void addv(vector<T>& v, int loc, T val) {
	if (loc >= v.size())v.resize(loc + 1, 0);
	v[loc] += val;
}
/*const int mn = 2000005;
bool isp[mn];
vector<int> ps;
void init() {
	fill(isp + 2, isp + mn, true);
	for (int i = 2; i < mn; i++) {
		if (!isp[i])continue;
		ps.push_back(i);
		for (int j = 2 * i; j < mn; j += i) {
			isp[j] = false;
		}
	}
}*/

//[,val)
template<typename T>
auto prev_itr(set<T>& st, T val) {
	auto res = st.lower_bound(val);
	if (res == st.begin())return st.end();
	res--; return res;
}

//[val,)
template<typename T>
auto next_itr(set<T>& st, T val) {
	auto res = st.lower_bound(val);
	return res;
}
using mP = pair<modint, modint>;
mP operator+(mP a, mP b) {
	return { a.first + b.first,a.second + b.second };
}
mP operator+=(mP& a, mP b) {
	a = a + b; return a;
}
mP operator-(mP a, mP b) {
	return { a.first - b.first,a.second - b.second };
}
mP operator-=(mP& a, mP b) {
	a = a - b; return a;
}
LP operator+(LP a, LP b) {
	return { a.first + b.first,a.second + b.second };
}
LP operator+=(LP& a, LP b) {
	a = a + b; return a;
}
LP operator-(LP a, LP b) {
	return { a.first - b.first,a.second - b.second };
}
LP operator-=(LP& a, LP b) {
	a = a - b; return a;
}

mt19937 mt(time(0));

const string drul = "DRUL";
string senw = "SENW";
//DRUL,or SENW
//int dx[4] = { 1,0,-1,0 };
//int dy[4] = { 0,1,0,-1 };

//------------------------------------

uniform_int_distribution<> ud2(0, 1);
string gen2(int n) {
	string res;
	rep(i, n) {
		char c = '0' + ud2(mt);
		res.push_back(c);
	}
	return res;
}


vector<int> objv = { 0,1,0,0,0,1,0,0,3,1,3,2,3,1,3,3 };
vector<int> getv(string s, int k) {
	vector<int> res;
	for (int i = 0; i < s.size(); i += 4) {
		int x = 0;
		rep(j, 4) {
			if (s[i + j] == '1')x |= (1 << j);
		}
		res.push_back(i + objv[x]);
	}
	res.resize(k);
	/*int loc = 0;
	rep(i, k) {
		chmax(loc,10)
		char c = '0';
		char c = '0' + (i % 2);
		while (s[loc] != c)loc++;
		res.push_back(loc);
		loc++;
	}*/
	return res;
}


vector<int> getvl(string s, int k) {
	vector<int> res;
	for (int i = 0; i < s.size(); i += 10) {
		bool exi = false;
		Rep(j, i, i + 10){
			/*if (j + 1 < i + 10 && s[j] != s[j + 1]) {
				j++;
				continue;
			}*/
			exi = true;
			res.push_back(j);
			break;
		}
		if (!exi)res.push_back(s[i + 9]);
	}
	/*int loc = 0;
	rep(i, k) {
		chmax(loc,10)
		char c = '0';
		char c = '0' + (i % 2);
		while (s[loc] != c)loc++;
		res.push_back(loc);
		loc++;
	}*/
	return res;
}
vector<int> getvr(string s, int k) {
	vector<int> res;
	for (int i = 0; i < s.size(); i += 10) {
		bool exi = false;
		Rep(j, i, i + 10) {
			if (s[j] == '0') {
				//if (j + 1 < i + 10 && s[j + 1] == '1')continue;
				exi = true;
				res.push_back(j);
				break;
			}
		}
		if (!exi)res.push_back(s[i + 9]);
	}
	/*int loc = 0;
	rep(i, k) {
		chmax(loc,10)
		char c = '0';
		char c = '0' + (i % 2);
		while (s[loc] != c)loc++;
		res.push_back(loc);
		loc++;
	}*/
	return res;
}


void expr() {
	
	//for (int n = 2; n <= 4; n++) {
	//	vector<vector<int>> vs;
	//	vector<int> cur;

	//	int maa = 0;
	//	function<void()> dfs = [&]() {
	//		if (cur.size() == (1 << n)) {
	//			vs.push_back(cur);

	//			auto vl = cur;
	//			auto vr = cur;
	//			int c = 0;
	//			rep(i, (1 << n))rep(j, (1 << n)) {
	//				int locl = vl[i];
	//				int locr = vr[j];

	//				bool bl = false, br = false;
	//				if (i & (1 << locr))bl = true;
	//				if (j & (1 << locl))br = true;
	//				if (bl == br) {
	//					c++;
	//				}
	//			}
	//			int num = (1 << (2 * n));
	//			if (maa <= c) {
	//				maa = c;
	//				cout << c << "\n";
	//				coutarray(cur);
	//			}
	//		}
	//		else {
	//			rep(i, n) {
	//				cur.push_back(i);
	//				dfs();
	//				cur.pop_back();
	//			}
	//		}
	//	};
	//	dfs();
	//	//cout << vs.size() << "\n";
	//	int ma = 0;
	//	for (auto vl : vs){
	//		auto vr = vl;
	//		int c = 0;
	//		rep(i, (1 << n))rep(j, (1 << n)) {
	//			int locl = vl[i];
	//			int locr = vr[j];

	//			bool bl = false, br = false;
	//			if (i & (1 << locr))bl = true;
	//			if (j & (1 << locl))br = true;
	//			if (bl == br) {
	//				c++;
	//			}
	//		}
	//		if (c == 44) {
	//			cout << "hello\n";
	//			coutarray(vl);
	//			coutarray(vr);
	//		}
	//		chmax(ma, c);
	//	}
	//	cout << ma << "\n";
	//}
	//return;
	/*int ma = 0;

	rep(i, 1 << 4)rep(j, 1 << 4) {
		int c = 0;
		rep(k, 4)rep(l, 4) {
			int locl = 0;
			if (i & (1 << k))locl = 1;
			int locr = 0;
			if (j & (1 << l))locr = 1;
			bool bl = false, br = false;
			if (k & (1 << locr))bl = true;
			if (l & (1 << locl))br = true;
			if (bl == br) {
				c++;
			}
		}
		chmax(ma, c);
	}

	cout << ma << "\n";*/
	rep(t, 100) {
		int n = 1000000;
		int k = 100000;
		string sl = gen2(n);
		string sr = gen2(n);
		vector<int> vl = getv(sl, k);
		vector<int> vr = getv(sr, k);
		int c = 0;
		rep(i, k)if (sr[vl[i]] == sl[vr[i]])c++;
		//cout << sl << " " << sr << "\n";
		cout << c << "\n";
		if (c <= k * 2 / 3) {
			cout << "out!!\n"; exit(0);
		}
	}
}


//const int mn = 10;
//ld dp[mn][mn];
//void expr2() {
//	rep(i, mn)rep(j, mn) {
//		if (i == 0 || j == 0) {
//			dp[i][j] = 0.5;
//		}
//		else {
//			ld v = 0;
//			ld coef = 0.25;
//			//00
//			if (i == 1 && j == 1) {
//				v += coef;
//			}
//			else {
//				v += coef * dp[i - 1][j - 1];
//			}
//			//01
//			v += coef * dp[i - 1][j];
//			//10
//			v += coef * dp[i][j - 1];
//			//11
//			//
//			dp[i][j] = v * 4 / 3.0;
//		}
//	}
//	for (int i = 1; i < 10; i++) {
//		for (int j = 1; j < 10; j++) {
//			cout << dp[i][j] << " ";
//		}
//		cout << "\n";
//	}
//	/*rep1(i, mn - 1) {
//		cout << i << " " << dp[i][i] << "\n";
//	}*/
//}


void solve() {
	string in; cin >> in;
	int n, k; cin >> n >> k;
	string s; cin >> s;
	vector<int> res = getv(s, k);
	rep(i, res.size())res[i]++;
	coutarray(res);
}



signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed<<setprecision(10);
	//init_f();
	//init();
	//while(true)
	//expr();
	//int t; cin >> t; rep(i, t)
	solve();
	return 0;
}