#include <bits/stdc++.h>
using namespace std;
const long long oo = 1e18;
const long long MAXN = 1e5 + 100;
long long N, K;
string primero = "tokitsukaze";
string segundo = "quailty";
string empate = "once again";
char A[MAXN];
set<long long> zeros;
set<long long> unos;
bool check() {
  if (!unos.size() || !zeros.size()) return true;
  long long a0 = *zeros.begin();
  long long b0 = *(--zeros.end());
  long long a1 = *unos.begin();
  long long b1 = *(--unos.end());
  if (b0 - a0 + 1 <= K || b1 - a1 + 1 <= K) return true;
  return false;
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> N >> K;
  for (long long i = 1; i <= N; i++) {
    cin >> A[i];
    if (A[i] == '0')
      zeros.insert(i);
    else
      unos.insert(i);
  }
  if (check()) {
    cout << primero << '\n';
    return 0;
  }
  bool flag = true;
  for (long long i = 1; i <= K; i++) {
    if (A[i] == '1') {
      unos.erase(unos.find(i));
      zeros.insert(i);
    }
  }
  if (!check()) flag = false;
  for (long long i = 1; i + K <= N; i++) {
    if (A[i + K] == '1') {
      unos.erase(unos.find(i + K));
      zeros.insert(i + K);
    }
    if (A[i] == '1') {
      zeros.erase(zeros.find(i));
      unos.insert(i);
    }
    if (!check()) flag = false;
  }
  zeros.clear();
  unos.clear();
  for (long long i = 1; i <= N; i++) {
    if (A[i] == '0')
      zeros.insert(i);
    else
      unos.insert(i);
  }
  for (long long i = 1; i <= K; i++) {
    if (A[i] == '0') {
      zeros.erase(zeros.find(i));
      unos.insert(i);
    }
  }
  if (!check()) flag = false;
  for (long long i = 1; i + K <= N; i++) {
    if (A[i + K] == '0') {
      zeros.erase(zeros.find(i + K));
      unos.insert(i + K);
    }
    if (A[i] == '0') {
      unos.erase(unos.find(i));
      zeros.insert(i);
    }
    if (!check()) flag = false;
  }
  if (flag) {
    cout << segundo << '\n';
    return 0;
  }
  cout << empate << '\n';
  return 0;
}
