#include <bits/stdc++.h>
using namespace std;
const long long INF = 1000000007;
const int MOD = 1000000007;
const int nmax = 201234;
int n, k, l[2], r[2], l2[2], r2[2];
char s[nmax];
int main() {
  scanf("%d%d", &n, &k);
  scanf("%s", s);
  for (int i = 0; i < n; ++i)
    if (s[i] == '0') {
      l[0] = i;
      break;
    }
  for (int i = 0; i < n; ++i)
    if (s[i] == '1') {
      l[1] = i;
      break;
    }
  for (int i = n - 1; i >= 0; --i)
    if (s[i] == '0') {
      r[0] = i;
      break;
    }
  for (int i = n - 1; i >= 0; --i)
    if (s[i] == '1') {
      r[1] = i;
      break;
    }
  if (r[1] - l[1] + 1 <= k || r[0] - l[0] + 1 <= k)
    printf("tokitsukaze\n");
  else if (r[1] - l[1] > k || r[0] - l[0] > k)
    printf("once again\n");
  else {
    l2[0] = max(l[0], k);
    l2[1] = max(l[1], k);
    while (l2[0] < n && s[l2[0]] != '0') ++l2[0];
    while (l2[1] < n && s[l2[1]] != '1') ++l2[1];
    r2[0] = min(r[0], n - k - 1);
    r2[1] = min(r[0], n - k - 1);
    while (r2[0] >= 0 && s[r2[0]] != '0') --r2[0];
    while (r2[1] >= 0 && s[r2[1]] != '1') --r2[1];
    if (r[0] - l2[0] >= k || r[1] - l2[1] >= k || r2[0] - l[0] >= k ||
        r2[1] - l[1] >= k)
      printf("once again\n");
    else
      printf("quailty\n");
  }
  return 0;
}
