#include <bits/stdc++.h>
using namespace std;
const int NN = 202020;
int l[2], r[2], L[2], R[2];
char s[NN];
int main() {
  int n, k;
  cin >> n >> k;
  scanf("%s", s);
  set<int> p[2];
  for (int i = 0; i < n; i++) {
    if (s[i] == '0')
      p[0].insert(i);
    else
      p[1].insert(i);
  }
  if (p[0].empty() || p[1].empty()) {
    puts("tokitsukaze");
    return 0;
  }
  for (int i = 0; i < 2; i++) {
    l[i] = *p[i].begin();
    r[i] = *--p[i].end();
    if (r[i] - l[i] + 1 <= k) {
      puts("tokitsukaze");
      return 0;
    }
  }
  for (int i = 0; i < n - k; i++) {
    int st = i, ed = i + k - 1;
    for (int j = 0; j < 2; j++) {
      for (int f = 0; f < 2; f++) {
        L[f] = l[f];
        R[f] = r[f];
        if (j == f) {
          L[f] = min(L[f], st);
          R[f] = max(R[f], ed);
        } else {
          if (st <= L[f] && L[f] <= ed) {
            L[f] = max(L[f], *p[f].upper_bound(ed));
          } else if (st <= R[f] && R[f] <= ed) {
            R[f] = min(R[f], *--p[f].lower_bound(st));
          }
        }
      }
      if (R[j] - L[j] + 1 > k && R[j ^ 1] - L[j ^ 1] + 1 > k) {
        puts("once again");
        return 0;
      }
    }
  }
  puts("quailty");
  return 0;
}
