#include <bits/stdc++.h>
#pragma GCC optimize(3, "Ofast", "inline")
using namespace std;
mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
const long long maxn = (long long)2e6 + 5;
const long long mod = 1e9 + 7;
const long long inf = 0x3f3f3f3f;
long long T = 1;
long long l[maxn], r[maxn];
char s[maxn];
void solve() {
  long long n, k;
  cin >> n >> k;
  cin >> (s + 1);
  l[1] = 1, r[n] = n;
  for (long long i = 2; i <= n; ++i) l[i] = (s[i] == s[i - 1] ? l[i - 1] : i);
  for (long long i = n - 1; i >= 1; --i)
    r[i] = (s[i] == s[i + 1] ? r[i + 1] : i);
  if (n == k || l[n - k] == 1 || r[k + 1] == n) {
    cout << "tokitsukaze";
    return;
  }
  for (long long i = 2; i <= n - k; ++i) {
    if (s[i - 1] == s[i + k] && l[i - 1] == 1 && r[i + k] == n) {
      cout << "tokitsukaze";
      return;
    }
  }
  if (k * 2 >= n) {
    for (long long i = 2; i <= n - k; ++i) {
      if (l[i - 1] != 1 || r[i + k] != n) {
        cout << "once again";
        return;
      }
    }
    cout << "quailty";
    return;
  }
  cout << "once again";
}
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  ;
  while (T--) solve();
  return 0;
}
