#include <bits/stdc++.h>
using namespace std;
void parseArray(long long* A, long long n) {
  for (long long K = 0; K < n; K++) {
    cin >> A[K];
  }
}
long long modInverse(long long a, long long b) {
  return 1 < a ? b - modInverse(b % a, a) * b / a : 1;
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); }
long double dist(long long x, long long y, long long a, long long b) {
  return sqrt((x - a) * (x - a) + (y - b) * (y - b));
}
void debug(long long* a, long long n) {
  for (int k = 0; k < n; k++) {
    cout << a[k] << " ";
  }
  cerr << "\n";
}
int main() {
  long long n, k;
  cin >> n >> k;
  string s;
  cin >> s;
  long long x = 1, y = 1;
  for (long long i = 1; i < n; i++) {
    if (s[i] == s[0])
      x++;
    else
      break;
  }
  for (long long i = n - 2; i >= 0; i--) {
    if (s[i] == s[n - 1])
      y++;
    else
      break;
  }
  if (n - x <= k || n - y <= k || (s[0] == s[n - 1] && n - x - y <= k))
    return cout << "tokitsukaze", 0;
  if (n > 2 * k) return cout << "once again", 0;
  long long cnt = 0;
  for (long long i = 1; i < n - k; i++) {
    if (x >= i && n - i - k <= y) cnt++;
  }
  if (cnt == n - k - 1)
    cout << "quailty";
  else
    cout << "once again";
}
