#include <bits/stdc++.h>
using namespace std;
int n, k, a[100005];
int L[100005], R[100005];
int main() {
  scanf("%d %d", &n, &k);
  for (int i = 1; i <= n; i++) scanf("%1d", &a[i]);
  bool flag = false;
  for (int i = 1; i < n; i++)
    if (a[i] != a[i + 1]) {
      flag = true;
      break;
    }
  if (!flag) {
    printf("tokitsukaze");
    return 0;
  }
  L[0] = 1;
  for (int i = 1; i <= n; i++)
    if (a[i] == a[i - 1])
      L[i] = L[i - 1];
    else
      L[i] = i;
  R[n + 1] = n;
  for (int i = n; i > 0; i--)
    if (a[i] == a[i + 1])
      R[i] = R[i + 1];
    else
      R[i] = i;
  int num = 0;
  for (int i = 1; i <= n - k + 1; i++)
    if (L[i - 1] == 1 && R[i + k] == n)
      if (i == 1 || i + k - 1 == n || a[i - 1] == a[i + k]) {
        printf("tokitsukaze");
        return 0;
      } else {
        if (i - 1 <= k && n + 1 <= 2 * k + i) num++;
      }
    else if (i == 1) {
      if (n + 1 <= 2 * k + 1) num++;
    } else if (i + k - 1 == n) {
      if (i - 1 <= k) num++;
    }
  if (num == n - k + 1)
    printf("quailty");
  else
    printf("once again");
  return 0;
}
