#include <bits/stdc++.h>
using namespace std;
void read(int &x) {
  x = 0;
  int f = 1;
  char ch = getchar();
  for (; !isdigit(ch); ch = getchar())
    if (ch == '-') f = -f;
  for (; isdigit(ch); ch = getchar()) x = x * 10 + ch - '0';
  x *= f;
}
void print(int x) {
  if (x < 0) putchar('-'), x = -x;
  if (!x) return;
  print(x / 10), putchar(x % 10 + 48);
}
void write(int x) {
  if (!x)
    putchar('0');
  else
    print(x);
  putchar('\n');
}
const int maxn = 1e5 + 10;
const int inf = 1e9;
const double eps = 1e-8;
const int mod = 1e9 + 7;
char s[maxn];
int n, k;
void check1() {
  int mn = 1e9, mx = 0;
  for (int i = 1; i <= n; i++)
    if (s[i]) mn = min(mn, i), mx = max(mx, i);
  if (mx - mn + 1 <= k) puts("tokitsukaze"), exit(0);
}
int pre[maxn][2], nxt[maxn][2];
void check2() {
  for (int i = 1; i <= n; i++)
    if (s[i])
      pre[i][1] = i, pre[i][0] = pre[i - 1][0];
    else
      pre[i][1] = pre[i - 1][1], pre[i][0] = i;
  for (int i = n; i; i--)
    if (s[i])
      nxt[i][1] = i, nxt[i][0] = nxt[i + 1][0];
    else
      nxt[i][1] = nxt[i + 1][1], nxt[i][0] = i;
  for (int i = 1; i <= n - k + 1; i++) {
    for (int x = 0; x <= 1; x++) {
      int mx, mn, bo = 0;
      for (int j = 0; j <= 1; j++) {
        if (i == 1 || pre[i - 1][j] == 0)
          mn = nxt[i + k][j];
        else
          mn = pre[i - 1][j];
        if (i + k - 1 == n || nxt[i + k][j] == 0)
          mx = pre[i - 1][j];
        else
          mx = pre[n][j];
        if (x == j) mx = max(mx, i + k - 1), mn = min(mn, i);
        if (mx - mn + 1 <= k) bo = 1;
      }
      if (!bo) return;
    }
  }
  puts("quailty");
  exit(0);
}
int main() {
  read(n), read(k);
  scanf("%s", s + 1);
  for (int i = 1; i <= n; i++) s[i] -= '0';
  check1();
  for (int i = 1; i <= n; i++) s[i] ^= 1;
  check1();
  for (int i = 1; i <= n; i++) s[i] ^= 1;
  check2();
  puts("once again");
  return 0;
}
