#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 1000000 + 5;

int N, K;
char s[MAX_N], ans[MAX_N];
int f[MAX_N];

int main() {
    scanf("%d%d", &N, &K);
    scanf("%s", s + 1);
    f[1] = 0, ans[1] = K == 1 ? '1' : '0';
    for (int i = 2, j = 0; i <= N; i ++) {
        for (; j >= 1 && s[i] != s[j + 1]; j = f[j]);
        f[i] = j += s[i] == s[j + 1];
        int t = i - f[i], c = i / t;
        ans[i] = '0' + (c % K == 0 || i % t == 0 && c % (K + 1) == 0);
    }
    printf("%s", ans + 1);
    return 0;
}