#include <bits/stdc++.h>
using namespace std;
inline long long rint() {
  long long x = 0, f = 1;
  char c = getchar();
  while (c < '0' || c > '9') {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') {
    x = x * 10 + c - '0';
    c = getchar();
  }
  return x * f;
}
inline long long gcd(long long a, long long b) {
  return (b) ? gcd(b, a % b) : a;
}
inline long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
inline long long pow(long long a, long long b, long long q) {
  long long rtn = 1;
  while (b) {
    if (b & 1) rtn = rtn * a % q;
    a = a * a % q;
    b >>= 1;
  }
  return rtn;
}
inline long long mysqrt(long long n) {
  long long x = sqrt(n);
  while (x * x < n) x++;
  while (x * x > n) x--;
  return x;
}
const long long MOD = 1e9 + 7;
const long long MAXN = 1e6 + 7;
int main() {
  int n = rint(), m = rint();
  string s;
  cin >> s;
  s = " " + s;
  int min0 = n + 1, max0 = 0, min1 = n + 1, max1 = 0;
  for (int i = 1; i <= n; i++) {
    if (s[i] == '1') min1 = min(min1, i), max1 = max(max1, i);
    if (s[i] == '0') min0 = min(min0, i), max0 = max(max0, i);
  }
  if (max0 == 0 || max1 == 0) {
    cout << "tokitsukaze"
         << "\n";
    return 0;
  }
  if (max0 - min0 + 1 <= m || max1 - min1 + 1 <= m) {
    cout << "tokitsukaze"
         << "\n";
    return 0;
  }
  if (m == 1 && n >= 3) {
    cout << "once again"
         << "\n";
    return 0;
  }
  if (m == 1 && n <= 2) {
    cout << "tokitsukaze"
         << "\n";
    return 0;
  }
  if (m * 2 < n) {
    cout << "once again"
         << "\n";
    return 0;
  }
  for (int i = m + 3; i <= n; i++)
    if (s[i] != s[i - 1]) {
      cout << "once again"
           << "\n";
      return 0;
    }
  for (int i = 2; i <= n - m - 1; i++)
    if (s[i] != s[i - 1]) {
      cout << "once again"
           << "\n";
      return 0;
    }
  cout << "quailty"
       << "\n";
}
