#include <bits/stdc++.h>
using namespace std;
inline int read() {
  int x = 0, f = 1;
  char cc = getchar();
  while (cc < '0' || cc > '9') {
    if (cc == '-') f = -1;
    cc = getchar();
  }
  while (cc >= '0' && cc <= '9') {
    x = x * 10 + cc - '0';
    cc = getchar();
  }
  return x * f;
}
int n, k, a[100010], flag, l1, r1, l2, r2;
int x1[100010], yy1[100010], x2[100010], yy2[100010];
string s;
int main() {
  n = read();
  k = read();
  cin >> s;
  for (int i = 0; i < n; i++) a[i + 1] = s[i] - '0';
  flag = 0;
  for (int i = 1; i < n; i++)
    if (a[i] != a[i + 1]) flag = 1;
  if (!flag) {
    printf("tokitsukaze");
    return 0;
  }
  l1 = n;
  r1 = 1;
  l2 = n;
  r2 = 1;
  for (int i = 1; i <= n; i++) {
    if (a[i] == 0) {
      l1 = min(l1, i);
      r1 = max(r1, i);
    }
    if (a[i] == 1) {
      l2 = min(l2, i);
      r2 = max(r2, i);
    }
  }
  if (r1 - l1 + 1 <= k || r2 - l2 + 1 <= k) {
    printf("tokitsukaze");
    return 0;
  }
  x1[0] = x2[0] = 0;
  for (int i = 1; i <= n; i++) {
    if (a[i] == 0)
      x1[i] = i;
    else
      x1[i] = x1[i - 1];
    if (a[i] == 1)
      x2[i] = i;
    else
      x2[i] = x2[i - 1];
  }
  yy1[n + 1] = yy2[n + 1] = n + 1;
  for (int i = n; i >= 1; i--) {
    if (a[i] == 0)
      yy1[i] = i;
    else
      yy1[i] = yy1[i + 1];
    if (a[i] == 1)
      yy2[i] = i;
    else
      yy2[i] = yy2[i + 1];
  }
  flag = 0;
  for (int i = 1; i <= n - k + 1; i++) {
    int ll1, rr1, ll2, rr2;
    ll1 = min(l1, i);
    rr1 = max(r1, i + k - 1);
    if (i <= l2 && l2 <= i + k - 1)
      ll2 = yy2[i + k];
    else
      ll2 = l2;
    if (i <= r2 && r2 <= i + k - 1)
      rr2 = x2[i - 1];
    else
      rr2 = r2;
    if (rr1 - ll1 + 1 > k && rr2 - ll2 + 1 > k) flag = 1;
    ll2 = min(l2, i);
    rr2 = max(r2, i + k - 1);
    if (i <= l1 && l1 <= i + k - 1)
      ll1 = yy1[i + k];
    else
      ll1 = l1;
    if (i <= r1 && r1 <= i + k - 1)
      rr1 = x1[i - 1];
    else
      rr1 = r1;
    if (rr1 - ll1 + 1 > k && rr2 - ll2 + 1 > k) flag = 1;
  }
  if (!flag) {
    printf("quailty");
    return 0;
  }
  printf("once again");
}
