// Problem: Om Nom and Necklace
// Contest: Luogu
// URL: https://www.luogu.com.cn/problem/CF526D
// Memory Limit: 250 MB
// Time Limit: 1000 ms
// Challenger: Erica N
// ----
#include<bits/stdc++.h>

using namespace std;
#define rd read()
#define ull unsigned long long
#define int long long 
#define itn int
#define ps second 
#define pf first

int  read(){
	int x;
	cin>>x;
	return x;
}
#define zerol = 1
#ifdef zerol
#define cdbg(x...) do { cerr << #x << " -> "; err(x); } while (0)
void err() {
	cerr << endl;
}
template<template<typename...> class T, typename t, typename... A>
void err(T<t> a, A... x) {
	for (auto v: a) cerr << v << ' ';
	err(x...);
}
template<typename T, typename... A>
void err(T a, A... x) {
	cerr << a << ' ';
	err(x...);
}
#else
#define dbg(...)
#endif
const int N=2e6+5;
const ull P=137;
const int INF=1e9+7;
/*

策略


*/
int nxt[N];
string s;
int n,K;

void getNxt(){
	for(int i=2;i<=n;i++){
		int j=nxt[i-1];
		while(s[j+1]!=s[i]&&j)j=nxt[j];
		if(s[j+1]==s[i])j++;
		nxt[i]=j;
	}
}

signed main(){
	n=rd,K=rd;
	cin>>s;
	s=" "+s;
	getNxt();
	
	
	for(int i=1;i<=n;i++){
		int len=i-nxt[i];
		int d=i/len;
		if(i%len){
			if(d/K-d%K>0)cout<<1;
			else cout<<0;
		}else{
			if(d/K-d%K>=0)cout<<1;
			else cout<<0;
		}
		
	}
}