#include<bits/stdc++.h>
using namespace std;
#define uint unsigned int
#define MAXN 1000010
int n,k,c[MAXN];
string s;
uint pw[MAXN],vh[MAXN];
inline bool subtask(){
	if(n==1) return true;
	if(s[1]==s[2]) return false;
	for(int i=3;i<=n;++i)if(s[i]!=s[i-2]) return false;
	return true;
}inline bool cmp(int l1,int r1,int l2,int r2){
	return (vh[r1]-vh[l1-1])*pw[n-r1]==(vh[r2]-vh[l2-1])*pw[n-r2];
}
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0),cout.tie(0);
	cin>>n>>k>>s;s=' '+s;
	if(subtask()){
		for(int i=2;i*k<=n;i+=2) ++c[i*k],--c[min(n+1,i*(k+1)+1)];
		for(int i=1;i<=n;++i) c[i]+=c[i-1],cout<<bool(c[i]);
		cout<<endl;
		return 0;
	}pw[0]=1;for(int i=1;i<=n;++i) pw[i]=pw[i-1]*131;
	for(int i=1;i<=n;++i) vh[i]=vh[i-1]+(s[i]-'a'+1)*pw[i];
	for(int i=1;i<=n;++i){
		bool ff=false;
		for(int j=i%k;(i-j)/k>=j;j+=k)if(cmp(1,j,i-j+1,i)){
			bool flag=true;
			for(int p=(i-j)/k+1;p<=i-j;p+=(i-j)/k)
				if(!cmp(1,(i-j)/k,p,p+(i-j)/k-1)){flag=false;break;}
			if(flag){ff=true;break;}
		}cout<<ff;
	}cout<<endl;
	return 0;
}