//
//  na 2410.cpp
//  Competitive Programming
//
//  Created by m2 on 2024/11/25.
//

#include <stdio.h>
#include <iostream>
using namespace std;
typedef long long int ll;
const int maxn = 1e6 + 5;
const ll k1 = 131, m1 = 1e9 + 7, k2 = 1331, m2 = 998244353;
ll pk1[maxn], h1[maxn], pk2[maxn], h2[maxn];
int n, d[maxn], k;
char s[maxn];
inline void readint(int &v){
    v = 0;
    char r = getchar();
    while(r - 48 >= 10u)
        r = getchar();
    do{
        v = (v << 1) + (v << 3) + (r ^ 48);
        r = getchar();
    }while(r - 48 < 10u);
}
inline ll mod1(ll x){
    return (x %= m1) < 0? x + m1: x;
}
inline ll mod2(ll x){
    return (x %= m2) < 0? x + m2: x;
}
int main(){
    cin.tie(0)->sync_with_stdio(false);
//    readint(n); readint(k);
    cin >> n >> k;
    if(n == 1145141919){
        n = 1e6;
        for(int i = 1; i <= n; ++i)
            s[i] = 'a';
    }else{
        cin >> s;
        for(int i = n; i; --i)
            s[i] = s[i - 1];
        s[0] = 0;
//        for(int i = 1; i <= n; ++i){
//            char r = getchar();
//            if(r - 97 >= 26u)
//                continue;
//            s[i] = r;
//        }
    }
//    cerr << "s = ";
//    for(int i = 1; i <= n; ++i)
//        cerr << s[i];
//    cerr << endl;
    pk1[0] = pk2[0] = 1;
    for(int i = 1; i <= n; ++i){
        pk1[i] = pk1[i - 1] * k1 % m1;
        pk2[i] = pk2[i - 1] * k2 % m2;
    }
    for(int i = 1; i <= n; ++i){
        h1[i] = (h1[i - 1] * k1 + s[i]) % m1;
        h2[i] = (h2[i - 1] * k2 + s[i]) % m2;
    }
    for(int l = 1; l * k <= n; ++l){
//        cerr << "pattern len = " << l << endl;
        bool f = true;
        for(int i = 2, p = l * 2; i <= k; ++i, p += l)
            if(mod1(h1[p] - h1[p - l] * pk1[l]) != h1[l] || mod2(h2[p] - h2[p - l] * pk2[l]) != h2[l]){
                f = false;
                break;
            }
        if(!f)
            continue;
//        cerr << "passed" << endl;
        int st = l * k, lt = 0, mid, rt = min(l, n - l * k) + 1;
        while(lt < rt - 1){
            mid = (lt + rt) >> 1;
            if(h1[mid] == mod1(h1[st + mid] - h1[st] * pk1[mid]) && h2[mid] == mod2(h2[st + mid] - h2[st] * pk2[mid]))
                lt = mid;
            else
                rt = mid;
        }
//        cerr << "start = " << st << endl;
        ++d[st];
//        cerr << "end = " << st + lt << endl;
        --d[st + lt + 1];
    }
    for(int i = 1; i <= n; ++i)
        putchar(bool(d[i] += d[i - 1]) ^ 48);
    putchar('\n');
    fflush(stdout);
    return 0;
}