#include <bits/stdc++.h>
using namespace std;
int n, m;
int a[100005];
int sum[100005];
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; i++) {
    char c;
    scanf(" %c", &c);
    if (c == '0')
      a[i] = 0;
    else
      a[i] = 1;
    sum[i] = sum[i - 1] + a[i];
  }
  int k = n - m;
  for (int i = 1; i + m - 1 <= n; i++) {
    int j = i + m - 1;
    int cnt = sum[j] - sum[i - 1];
    int e = sum[n] - cnt;
    if (e == 0 || e == k) {
      printf("tokitsukaze");
      return 0;
    }
  }
  int sign = 0;
  for (int i = 2; i + m - 1 < n; i++) {
    int j = i + m - 1;
    int a = sum[i - 1] - sum[max(0, i - 1 - m)], la = i - 1;
    int b = sum[min(n, j + m)] - sum[j], lb = n - j;
    if (la > m || lb > m) {
      sign = 1;
      break;
    }
    if (a != la && a != 0) {
      sign = 1;
      break;
    }
    if (b != lb && b != 0) {
      sign = 1;
      break;
    }
  }
  if (sign)
    printf("once again");
  else
    printf("quailty");
  return 0;
}
