#include <bits/stdc++.h>
using namespace std;
long long read() {
  long long w = 0, f = 1;
  char c = ' ';
  while (c < '0' || c > '9') c = getchar(), f = c == '-' ? -1 : f;
  while (c >= '0' && c <= '9') w = w * 10 + c - 48, c = getchar();
  return w * f;
}
long long read01() {
  char c = getchar();
  while (c != '0' && c != '1') c = getchar();
  if (c == '1') return 1;
  return 0;
}
long long n, k, a[100005], w[100005];
long long sum(long long x, long long y) { return w[y] - w[x - 1]; }
signed main() {
  n = read(), k = read();
  for (long long i = 1; i <= n; i++) a[i] = read01(), w[i] = w[i - 1] + a[i];
  for (long long i = 1; i <= n - k + 1; i++)
    if (sum(1, i - 1) + sum(i + k, n) == 0 ||
        sum(1, i - 1) + sum(i + k, n) == n - k) {
      puts("tokitsukaze");
      return 0;
    }
  if (k == 1 || k * 2 < n || a[n - k - 1] == a[n - k] || a[k + 1] == a[k + 2] ||
      a[1] == a[n]) {
    puts("once again");
    return 0;
  }
  for (long long i = 2; i <= n - k - 1; i++)
    if (a[i] != a[i - 1] || a[n - i + 1] != a[n - i + 2]) {
      puts("once again");
      return 0;
    }
  puts("quailty");
  return 0;
}
