#include<bits/stdc++.h>
#define int long long
using namespace std;
void ts(){cout<<"IAKIOI\n";}
inline int read(){
	int n=0,f=1,ch=getchar();
	while(ch<'0'||ch>'9'){
		if(ch=='-')f=-1;
		ch=getchar();
	}
	while(ch>='0'&&ch<='9'){
		n=n*10+ch-'0';
		ch=getchar();
	}
	return n*f;
}
const int mod=998244353;
struct mint{
    int x;mint(int o=0){x=o;}mint&operator+=(mint a){return(x+=a.x)%=mod,*this;}mint&operator-=(mint a){return(x+=mod-a.x)%=mod,*this;}
    mint&operator*=(mint a){return(x=1ll*x*a.x%mod),*this;}mint&operator^=( int b){mint a=*this;x=1;while(b)(b&1)&&(*this*=a,1),a*=a,b>>=1;return*this;}
    mint&operator/=(mint a){return*this*=(a^=mod-2);}friend mint operator+(mint a,mint b){return a+=b;}friend mint operator-(mint a,mint b){return a-=b;}
    friend mint operator*(mint a,mint b){return a*=b;}friend mint operator/(mint a,mint b){return a/=b;}friend mint operator^(mint a,int b){return a^=b;}
    mint operator-(){return 0-*this;}bool operator==(const mint b)const{return x==b.x;}
};
int n,k;
char s[1000005];
signed main(){
	n=read(),k=read();
	scanf("%s",s+1);
	for(int i=1;i<=n;i++){
		bool ok=0;
		for(int j=(i+k)/(k+1);j<=i/k;j++){
			//cout<<j<<" ";
			string a="";
			for(int x=j*k+1;x<=i;x++)a+=s[x];
			vector<string> al;
			for(int x=1;x<=j*k;x+=j){
				string cur="";
				for(int y=x;y<x+j;y++)cur+=s[y];
				al.push_back(cur);
			}
			sort(al.begin(),al.end());
			if(al[0]==al.back()){
				//if(i==13&&j==5){cout<<a<<"\n";}
				bool v=1;
				for(int x=1;x<=j*k;x+=j){
					string cur="";
					for(int y=x;y<=x+(int)a.size()-1;y++)cur+=s[y];
					if(cur!=a)v=0;
				}
				if(v){
					//cout<<i<<" "<<j<<" "<<a<<"\n";
					ok=1;break;
				}
			}
			//BA
		}
		putchar(ok+'0');
		//BABABABA
	}
	return 0;
}