#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
long long power(long long x, unsigned long long y, long long p) {
  long long res = 1;
  x = x % p;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
const long long INF = 1e18;
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  long long n, k;
  string s;
  cin >> n >> k >> s;
  vector<long long> o;
  vector<long long> v;
  s = '0' + s;
  for (long long i = 1; i < n + 1; i++) {
    if (s[i] == '0') {
      o.push_back(i);
    } else
      v.push_back(i);
  }
  if (v.size() == 0 || o.size() == 0) {
    cout << "tokitsukaze"
         << "\n";
    return 0;
  }
  if (v.size() >= 1 && v[v.size() - 1] - v[0] + 1 <= k) {
    cout << "tokitsukaze"
         << "\n";
  } else if (o.size() >= 1 && o[o.size() - 1] - o[0] + 1 <= k) {
    cout << "tokitsukaze"
         << "\n";
  } else {
    bool ok = true;
    if (k * 2 < n || k == 1) {
      ok = false;
    } else {
      long long len = n - k - 1;
      if (s[len] == s[len + 1] || s[n - len] == s[n - len + 1] ||
          s[1] == s[n]) {
        ok = false;
      }
      for (long long i = 2; i < len + 1; i++) {
        if (s[i] != s[i - 1] || s[n - i + 1] != s[n - i + 2]) ok = false;
      }
    }
    cout << (ok ? "quailty" : "once again") << "\n";
  }
  return 0;
}
