#include <bits/stdc++.h>
const int N = 1e5 + 10;
using namespace std;
int n, k, a0[N], a1[N], b0[N], b1[N];
char ch[N];
int main() {
  scanf("%d %d", &n, &k);
  scanf("%s", ch + 1);
  for (int i = 1; i <= n; i++) {
    a0[i] = a0[i - 1] + (ch[i] == '0');
    a1[i] = a1[i - 1] + (ch[i] == '1');
  }
  for (int i = n; i >= 1; i--) {
    b0[i] = b0[i + 1] + (ch[i] == '0');
    b1[i] = b1[i + 1] + (ch[i] == '1');
  }
  for (int i = 1; i <= n - k + 1; i++)
    if (a0[i - 1] + b0[i + k] == 0 || a1[i - 1] + b1[i + k] == 0) {
      puts("tokitsukaze");
      exit(0);
    }
  if (k >= n / 2) {
    if (k == n - 1) {
      puts("quailty");
      exit(0);
    } else {
      if (ch[1] != ch[n]) {
        int bz = 0;
        for (int i = k + 2; i <= n; i++)
          if (ch[i] == ch[1]) {
            bz = 1;
            break;
          }
        for (int i = 1; i <= n - k - 1; i++)
          if (ch[i] == ch[n]) {
            bz = 1;
            break;
          }
        if (!bz) {
          puts("quailty");
          exit(0);
        };
      }
    }
  }
  puts("once again");
}
