#include <bits/stdc++.h>
using namespace std;
int a[100005];
char b[100005];
int main() {
  int n, k;
  scanf("%d %d", &n, &k);
  scanf("%s", b + 1);
  for (int i = 1; i <= n; i++) a[i] = b[i] - '0';
  int ok1 = 0, first_0 = 0, first_1 = 0;
  for (int i = 1; i <= n; i++) {
    if (first_0 && first_1) break;
    if (a[i] == 0 && (!first_0)) first_0 = i;
    if (a[i] == 1 && (!first_1)) first_1 = i;
  }
  int flag = 1;
  for (int i = first_1 + k; i <= n; i++)
    if (a[i] == 1) {
      flag = 0;
      break;
    }
  if (flag) ok1 = 1;
  flag = 1;
  for (int i = first_0 + k; i <= n; i++)
    if (a[i] == 0) {
      flag = 0;
      break;
    }
  if (flag) ok1 = 1;
  if (ok1) {
    printf("tokitsukaze\n");
    return 0;
  }
  int ok2 = 0;
  int l, r;
  if (n >= k + 2 && n <= 2 * k) {
    int l = a[1], r = a[n];
    flag = 1;
    for (int i = k + 2; i <= n; i++)
      if (a[i] != r) {
        flag = 0;
        break;
      }
    for (int i = 1; i <= n - k - 1; i++)
      if (a[i] != l) {
        flag = 0;
        break;
      }
    if (flag) ok2 = 1;
  }
  if (ok2) {
    printf("quailty\n");
    return 0;
  }
  printf("once again\n");
  return 0;
}
