#include<bits/stdc++.h>
#define b1 719
#define b2 1237
#define m1 998244353
#define m2 1000000007
using namespace std;
int n,k;
char s[1000005];
typedef long long ll;
ll h1[1000005],h2[1000005];
ll p1[1000005],p2[1000005];
int ans[1000005];
int z[1000005];
int get1(int l,int r){
	return (h1[r]-h1[l-1]*p1[r-l+1]%m1+m1)%m1;
}
int get2(int l,int r){
	return (h2[r]-h2[l-1]*p2[r-l+1]%m2+m2)%m2;
}
int main(){
	scanf("%d%d",&n,&k);
	scanf("%s",s+1);
	for(int i=1;i<=n;i++)h1[i]=(h1[i-1]*b1+s[i])%m1,h2[i]=(h2[i-1]*b2+s[i])%m2;
	p1[0]=p2[0]=1;
	for(int i=1;i<=n;i++)p1[i]=p1[i-1]*b1%m1,p2[i]=p2[i-1]*b2%m2;
	int L=1,R=1;
	z[1]=0;
//	printf("%d",0);
	for(int i=2;i<=n;i++){
		if(i<=R && i+z[i-L+1]-1<R)z[i]=z[i-L+1];
		else{
			z[i]=max(0,R-i+1);
			while(i+z[i]<=n && s[i+z[i]]==s[1+z[i]])z[i]++;
		}
		if(i+z[i]-1>R)R=i+z[i]-1,L=i;
//		printf("%d",z[i]);
	}
//	printf("\n");
	for(int i=1;i*k<=n;i++){
		int fl=0;
		for(int j=1;j<k;j++)if(get1(i*j+1,i*j+i)!=h1[i] || get2(i*j+1,i*j+i)!=h2[i])fl=1;
		if(fl==1)continue;
		ans[i*k]++;
		ans[i*k+min(i,z[i*k+1])+1]--;
	}
	for(int i=1;i<=n;i++)ans[i]+=ans[i-1];
	for(int i=1;i<=n;i++){
		if(ans[i]>0)putchar('1');
		else putchar('0');
	}
	return 0;
}