#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
const int maxn1 = 1e9;
int read() {
  int x = 0, w = 1;
  char ch = getchar();
  while ((ch < '0' || ch > '9') && ch != '-') ch = getchar();
  if (ch == '-') w = 0, ch = getchar();
  while (ch >= '0' && ch <= '9')
    x = (x << 3) + (x << 1) + ch - '0', ch = getchar();
  return w ? x : -x;
}
char x[maxn];
int main() {
  int n = read(), k = read();
  scanf("%s", x);
  if (n <= k + 1) {
    printf("tokitsukaze\n");
    return 0;
  } else if (n == k + 2) {
    if (x[0] != x[n - 1]) {
      printf("quailty\n");
      return 0;
    } else {
      printf("tokitsukaze\n");
      return 0;
    }
  }
  int l = 1, r = n - 2;
  for (; l < n - 1; l++)
    if (x[l - 1] != x[l]) break;
  for (; r > 0; r--)
    if (x[r] != x[r + 1]) break;
  if (l - 1 > r) {
    printf("tokitsukaze\n");
    return 0;
  }
  if (n > 2 * k) {
    int num = l + n - r - 1;
    num = n - num;
    if (x[0] == x[n - 1] && num <= k || k + (n - r - 1) >= n || k + l >= n) {
      printf("tokitsukaze\n");
      return 0;
    } else {
      printf("once again\n");
      return 0;
    }
  } else {
    int num = l + n - r - 1;
    num = n - num;
    int num1 = n - r - 1 + 1, num2 = l + 1;
    num1 = n - num1, num2 = n - num2;
    if (x[0] == x[n - 1] && num <= k || k + (n - r - 1) >= n || k + l >= n) {
      printf("tokitsukaze\n");
      return 0;
    } else if (num1 <= k && num2 <= k) {
      printf("quailty\n");
      return 0;
    } else {
      printf("once again\n");
      return 0;
    }
  }
}
