#include <bits/stdc++.h>
using namespace std;
long long arr[100005];
char c;
long long ni[2], xi[2];
void solve() {
  memset(ni, -1, sizeof(ni));
  memset(xi, -1, sizeof(xi));
  long long n, k;
  cin >> n >> k;
  for (long long i = 0; i < n; i++) {
    cin >> c;
    if (ni[c - '0'] == -1) ni[c - '0'] = i;
    xi[c - '0'] = i;
  }
  long long a = xi[1] - ni[1] + 1, b = xi[0] - ni[0] + 1;
  if (a <= k || b <= k) {
    cout << "tokitsukaze\n";
    return;
  }
  if ((a == k + 1 && b == k + 1) && (n <= 2 * k)) {
    cout << "quailty\n";
    return;
  } else {
    cout << "once again\n";
  }
}
signed main() {
  ios_base::sync_with_stdio(false);
  long long t = 1;
  while (t--) solve();
  return 0;
}
