#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 10;
int n, k, f[2][2];
char c[N];
int main() {
  f[0][0] = f[1][0] = N;
  scanf("%d%d", &n, &k);
  scanf("%s", c + 1);
  for (int i = 1; i <= n; i++)
    f[(c[i] - '0')][0] = std::min(f[(c[i] - '0')][0], i),
              f[(c[i] - '0')][1] = std::max(f[(c[i] - '0')][1], i);
  for (int i = 0; i < 2; i++)
    if (f[i][1] - f[i][0] + 1 <= k) return printf("tokitsukaze\n"), 0;
  int fl = 1;
  for (int i = 0; i < 2; i++)
    if ((f[i][1] - f[i][0] + 1 != k + 1) || (f[i][0] >= k + 1) ||
        (f[i][1] + k <= n))
      fl = 0;
  if (fl)
    return printf("quailty\n"), 0;
  else
    return printf("once again\n"), 0;
}
