#include <bits/stdc++.h>
using namespace std;
char s[100100];
int L[2], R[2];
int main() {
  int n, k;
  cin >> n >> k;
  scanf("%s", s + 1);
  while (s[L[0] + 1] == '0') L[0]++;
  while (s[L[1] + 1] == '1') L[1]++;
  while (s[n - R[0]] == '0') R[0]++;
  while (s[n - R[1]] == '1') R[1]++;
  if (L[0] + R[0] >= n - k || L[1] + R[1] >= n - k)
    return puts("tokitsukaze"), 0;
  int ok = 0;
  for (int i = 1; i <= n - k + 1; i++) {
    int j = i + k - 1;
    ok = 1;
    if (L[0] >= i - 1) {
      if (j + R[0] >= n - k) ok = 0;
    }
    if (R[0] >= n - j) {
      if (L[0] + n - i + 1 >= n - k) ok = 0;
    }
    if (ok) break;
    ok = 1;
    if (L[1] >= i - 1) {
      if (j + R[1] >= n - k) ok = 0;
    }
    if (R[1] >= n - j) {
      if (L[1] + n - i + 1 >= n - k) ok = 0;
    }
    if (ok) break;
  }
  if (!ok)
    puts("quailty");
  else
    puts("once again");
  return 0;
}
