#include <bits/stdc++.h>
using namespace std;
const long long N = 1e5 + 7;
int le[N], ri[N];
long long n, k;
char s[N];
int main() {
  scanf("%lld%lld", &n, &k);
  scanf("%s", s + 1);
  le[1] = s[1] - '0';
  for (int i = 2; i <= n; i++) {
    if (le[i - 1] != s[i] - '0')
      le[i] = 2;
    else
      le[i] = le[i - 1];
  }
  ri[n] = s[n] - '0';
  for (int i = n - 1; i >= 1; i--) {
    if (ri[i + 1] != s[i] - '0')
      ri[i] = 2;
    else
      ri[i] = ri[i + 1];
  }
  if (n == k || ri[k + 1] != 2 || le[n - k] != 2) {
    printf("tokitsukaze\n");
    return 0;
  }
  bool flag = false;
  for (int i = 2; i + k <= n; i++) {
    if (le[i - 1] == ri[i + k] && le[i - 1] != 2) {
      printf("tokitsukaze\n");
      return 0;
    }
    if (le[i - 1] == 2 || ri[i + k] == 2) {
      flag = true;
    } else if (i - 1 > k || n - (i + k) + 1 > k) {
      flag = true;
    }
  }
  if (flag)
    printf("once again\n");
  else
    printf("quailty\n");
}
