#include <bits/stdc++.h>
using namespace std;
char s[123123];
int n, k;
int main() {
  int i, j, l, r, l1, r1, l0, r0;
  scanf("%d%d", &n, &k);
  scanf("%s", s + 1);
  l0 = r0 = 0;
  for (i = 1; i <= n; i++)
    if (s[i] == '0') {
      l0 = i;
      break;
    }
  for (i = n; i >= 1; i--)
    if (s[i] == '0') {
      r0 = i;
      break;
    }
  if (r0 - l0 + 1 <= k) {
    printf("tokitsukaze\n");
    return 0;
  }
  l1 = r1 = 0;
  for (i = 1; i <= n; i++)
    if (s[i] == '1') {
      l1 = i;
      break;
    }
  for (i = n; i >= 1; i--)
    if (s[i] == '1') {
      r1 = i;
      break;
    }
  if (r1 - l1 + 1 <= k) {
    printf("tokitsukaze\n");
    return 0;
  }
  l = r = 0;
  for (i = k + 1; i <= n; i++)
    if (s[i] == '1') {
      l = i;
      break;
    }
  for (i = n; i >= k + 1; i--)
    if (s[i] == '1') {
      r = i;
      break;
    }
  if (r - l + 1 > k) {
    printf("once again\n");
    return 0;
  }
  l = r = 0;
  for (i = 1; i <= n - k; i++)
    if (s[i] == '1') {
      l = i;
      break;
    }
  for (i = n - k; i >= 1; i--)
    if (s[i] == '1') {
      r = i;
      break;
    }
  if (r - l + 1 > k) {
    printf("once again\n");
    return 0;
  }
  if ((r1 - 1) - (l1 + 1) + 1 >= k) {
    printf("once again\n");
    return 0;
  }
  l = r = 0;
  for (i = k + 1; i <= n; i++)
    if (s[i] == '0') {
      l = i;
      break;
    }
  for (i = n; i >= k + 1; i--)
    if (s[i] == '0') {
      r = i;
      break;
    }
  if (r - l + 1 > k) {
    printf("once again\n");
    return 0;
  }
  l = r = 0;
  for (i = 1; i <= n - k; i++)
    if (s[i] == '0') {
      l = i;
      break;
    }
  for (i = n - k; i >= 1; i--)
    if (s[i] == '0') {
      r = i;
      break;
    }
  if (r - l + 1 > k) {
    printf("once again\n");
    return 0;
  }
  if ((r0 - 1) - (l0 + 1) + 1 >= k) {
    printf("once again\n");
    return 0;
  }
  printf("quailty\n");
  return 0;
}
