#include <cstdio>
#include <cstring>
#include <vector>
using namespace std;
char s[1000010];
int d[1000010];
int nxt[1000010], n, k, dfn[1000010], dfe[1000010], times = 0;
vector<int> son[1000010];
void dfs(int u) {
    dfn[u] = ++times;
    for (int v : son[u]) {
        dfs(v);
    }
    dfe[u] = times;
}
int main() {
    scanf("%d%d", &n, &k);
    scanf("%s", s + 1);
    nxt[1] = 0;
    son[0].push_back(1);
    for (int i = 2; i <= n; i++) {
        nxt[i] = nxt[i - 1];
        while (nxt[i] && s[nxt[i] + 1] != s[i]) nxt[i] = nxt[nxt[i]];
        if (s[nxt[i] + 1] == s[i]) {
            nxt[i]++;
        }
        son[nxt[i]].push_back(i);
    }
    dfs(0);
    for (int i = 1; i <= n; i++) {
        if (i % k == 0) {
            int len = i / k;
            if (dfn[i - len] <= dfn[i] && dfn[i] <= dfe[i - len]) {
                int l = 0, r = len, ans = 0;
                while (l <= r) {
                    int mid = (l + r) >> 1;
                    if (dfn[mid] <= dfn[i + mid] && dfn[i + mid] <= dfe[mid]) {
                        ans = mid;
                        l = mid + 1;
                    } else {
                        r = mid - 1;
                    }
                }
                d[i]++;
                d[i + ans + 1]--;
            }
        }
    }
    for (int i = 1; i <= n; i++) {
        d[i] += d[i - 1];
        if (d[i]) {
            printf("1");
        } else {
            printf("0");
        }
    }
    return 0;
}