#include<iostream>
#include<cassert>
#include<random>
using namespace std;
const int W=10;
mt19937 rng(114514);
int idx[1<<W];
int count(int id)
{
	int cnt=0;
	for(int j=0;j<1<<W;j++)
	{
		int u=j>>idx[id]&1;
		int v=id>>idx[j]&1;
		if(u==v)cnt++;
	}
	return cnt;
}
int now;
bool upd(int id,int nidx)
{
	assert(0<=id&&id<1<<W);
	assert(0<=nidx&&nidx<W);
	int pidx=idx[id];
	if(nidx==pidx)return false;
	int del=count(id);
	idx[id]=nidx;
	int ins=count(id);
	if(del<=ins)
	{
		now-=del;
		now+=ins;
		return true;
	}
	else
	{
		idx[id]=pidx;
		return false;
	}
}
const int N=1e6,K=1e5;
vector<int>solve(string s)
{
	assert(W*K==N);
	vector<int>ret;
	for(int i=0;i<N;i+=W)
	{
		int t=0;
		for(int j=i+W-1;j>=i;j--)t=t<<1|(s[j]-'0');
		ret.push_back(i+idx[t]);
	}
	assert(ret.size()==K);
	return ret;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	for(int i=0;i<1<<W;i++)
	{
		while(idx[i]+1<W&&!(i>>idx[i]&1))idx[i]++;
	}
	for(int i=0;i<1<<W;i++)now+=count(i);
	for(int t=0;++t<=17;)
	{
		for(int id=0;id<1<<W;id++)
		{
			for(int nidx=0;nidx<W;nidx++)
			{
				upd(id,nidx);
			}
		}
		//cout<<"["<<t<<"] "<<"now = "<<now<<", now/4^10-2/3 = "<<now*3-(1<<21)<<endl;
	}
	assert(now*3-(1<<21)==49150);
	/*
	while(true)
	{
		string s(N,'_'),t(N,'_');
		for(int i=0;i<N;i++)
		{
			s[i]=rng()%2+'0';
			t[i]=rng()%2+'0';
		}
		vector<int>a=solve(s),b=solve(t);
		int cnt=0;
		for(int i=0;i<K;i++)cnt+=s[b[i]]==t[a[i]];
		cout<<cnt<<endl;
		assert(cnt>=66667);
	}
	*/
	string op;cin>>op;
	int n,k;cin>>n>>k;
	string s;cin>>s;
	vector<int>ans=solve(s);
	for(int i=0;i<K;i++)cout<<ans[i]+1<<(i+1==K?"\n":" ");
}