#include <bits/stdc++.h>

using namespace std;

#define int long long
// #define x first
// #define y second
#define File(a) freopen(a".in", "r", stdin), freopen(a".out", "w", stdout)

inline void debug() { cerr << '\n'; }
template<typename Type, typename... Other>
inline void debug(const Type& x, const Other&... y) { cerr << x << ' '; debug(y...); }
#define DEBUG(a...) cerr << "[" << #a << "] = ", debug(a);

typedef long long LL;
typedef pair<int, int> PII;
typedef unsigned long long ULL;

const int N = 200010;
const int INF = 0x3f3f3f3f;
const int base = 131;

template<typename Type>
inline void read(Type &res)
{
    res = 0;
    int ch = getchar(), flag = 0;
    while (!isdigit(ch)) flag |= ch == '-', ch = getchar();
    while (isdigit(ch)) res = (res << 3) + (res << 1) + (ch ^ 48), ch = getchar();
    res = flag ? -res : res;
}
template<typename Type, typename... Other>
inline void read(Type &res, Other&... y) { read(res), read(y...); }

int n, k;
int kmp[N];
char str[N];
// ULL hsh[N], fc[N];

// inline ULL gethash(int l, int r) { return hsh[r] - hsh[l - 1] * fc[r - l + 1]; }

bool check(int idx)
{
    // for (int cur = kmp[idx]; cur; cur = kmp[cur])
    int cur = idx;
    do
    {
        cur = kmp[cur];
        int rest = idx - (k + 1) * cur;
        if (rest < 0 || rest % k != 0) continue;
        int lgst = kmp[idx - cur];
        if (!lgst) continue;
        if ((idx - cur) % (idx - cur - lgst) == 0 && ((idx - cur) / (idx - cur - lgst)) % k == 0) return true;
    } while (cur != 0);
    return false;
}

signed main()
{
    // for (int i = fc[0] = 1; i < N; i ++) fc[i] = fc[i - 1] * base;
    scanf("%lld%lld%s", &n, &k, str + 1);
    // for (int i = 1; i <= n; i ++)
    //     hsh[i] = hsh[i - 1] * base + str[i];

    for (int i = 2, j = 0; i <= n; i ++)
    {
        while (j && str[i] != str[j + 1]) j = kmp[j];
        if (str[i] == str[j + 1]) j ++;
        kmp[i] = j;
    }

    for (int i = 1; i <= n; i ++)
        putchar(check(i) ^ 48);
    putchar(10);

    return 0;
}