#include <bits/stdc++.h>
using namespace std;
template <typename T>
T in() {
  char ch;
  T n = 0;
  bool ng = false;
  while (1) {
    ch = getchar();
    if (ch == '-') {
      ng = true;
      ch = getchar();
      break;
    }
    if (ch >= '0' && ch <= '9') break;
  }
  while (1) {
    n = n * 10 + (ch - '0');
    ch = getchar();
    if (ch < '0' || ch > '9') break;
  }
  return (ng ? -n : n);
}
template <typename T>
inline T Dis(T x1, T y1, T x2, T y2) {
  return sqrt((x1 - x2 * x1 - x2) + (y1 - y2 * y1 - y2));
}
template <typename T>
inline T POW(T B, T P) {
  if (P == 0) return 1;
  if (P & 1)
    return B * POW(B, P - 1);
  else
    return (POW(B, P / 2) * POW(B, P / 2));
}
template <typename T>
inline T ABS(T a) {
  if (a < 0)
    return -a;
  else
    return a;
}
template <typename T>
inline T Gcd(T a, T b) {
  if (a < 0) return Gcd(-a, b);
  if (b < 0) return Gcd(a, -b);
  return (b == 0) ? a : Gcd(b, a % b);
}
template <typename T>
inline T Lcm(T a, T b) {
  if (a < 0) return Lcm(-a, b);
  if (b < 0) return Lcm(a, -b);
  return a * (b / Gcd(a, b));
}
long long Bigmod(long long base, long long power, long long MOD) {
  long long ret = 1;
  while (power) {
    if (power & 1) ret = (ret * base) % MOD;
    base = (base * base) % MOD;
    power >>= 1;
  }
  return ret;
}
long long ModInverse(long long number, long long MOD) {
  return Bigmod(number, MOD - 2, MOD);
}
int Set(int N, int pos) { return N = N | (1 << pos); }
int Reset(int N, int pos) { return N = N & ~(1 << pos); }
bool Chkbit(int N, int pos) { return (bool)(N & (1 << pos)); }
bool isVowel(char ch) {
  ch = toupper(ch);
  if (ch == 'A' || ch == 'U' || ch == 'I' || ch == 'O' || ch == 'E')
    return true;
  return false;
}
bool isConst(char ch) {
  if (isalpha(ch) && !isVowel(ch)) return true;
  return false;
}
int toInt(string s) {
  int sm;
  stringstream ss(s);
  ss >> sm;
  return sm;
}
long long int toLlint(string s) {
  long long int sm;
  stringstream ss(s);
  ss >> sm;
  return sm;
}
int Z[2000007], len, N;
char s[2000007];
void Z_algorithm() {
  int l = 0, r = 0;
  memset(Z, 0, sizeof(Z));
  for (int i = 1; i < len; i++) {
    if (i <= r) {
      Z[i] = min(r - i + 1, Z[i - l]);
    }
    while (i + Z[i] < len && s[Z[i]] == s[i + Z[i]]) {
      ++Z[i];
    }
    if (i + Z[i] - 1 > r) {
      l = i, r = i + Z[i] - 1;
    }
  }
  for (int i = N; i < len; i++) {
    Z[i - N] = Z[i];
  }
  return;
}
int Ok[2000007], OK[2000007];
void Check(int df, int k) {
  if ((long long int)(df) * (long long int)k > N) return;
  int st = 1;
  while (st <= N) {
    if (Z[st] >= df) {
      st += df;
      k--;
      if (!k) {
        Ok[st - 1] = 1;
        break;
      }
    } else
      break;
  }
  return;
}
int main() {
  int n, k;
  n = in<int>(), k = in<int>();
  scanf("%s", &s);
  len = strlen(s);
  N = len;
  s[len] = '@';
  for (int j = len + 1; j <= len + len; j++) s[j] = s[j - len - 1];
  len = strlen(s);
  Z_algorithm();
  for (int i = 1; i <= N; i++) {
    Check(i, k);
  }
  for (int i = 1; i <= N; i++) {
    if (Ok[i] == 1) {
      int id = min(Z[i + 1], i / k);
      OK[i]++;
      OK[id + i + 1]--;
    }
  }
  for (int i = 1; i <= N; i++) {
    OK[i] += OK[i - 1];
    if (OK[i]) {
      printf("1");
    } else
      printf("0");
  }
  printf("\n");
  return 0;
}
