#include <bits/stdc++.h>
using namespace std;
const int inf = (int)1e9;
const long long INF = (long long)5e18;
const int MOD = 998244353;
int _abs(int x) { return x < 0 ? -x : x; }
int add(int x, int y) {
  x += y;
  return x >= MOD ? x - MOD : x;
}
int sub(int x, int y) {
  x -= y;
  return x < 0 ? x + MOD : x;
}
void Add(int &x, int y) {
  x += y;
  if (x >= MOD) x -= MOD;
}
void Sub(int &x, int y) {
  x -= y;
  if (x < 0) x += MOD;
}
void Mul(int &x, int y) { x = (long long)(x) * (y) % MOD; }
int qpow(int x, int y) {
  int ret = 1;
  while (y) {
    if (y & 1) ret = (long long)(ret) * (x) % MOD;
    x = (long long)(x) * (x) % MOD;
    y >>= 1;
  }
  return ret;
}
void checkmin(int &x, int y) {
  if (x > y) x = y;
}
void checkmax(int &x, int y) {
  if (x < y) x = y;
}
void checkmin(long long &x, long long y) {
  if (x > y) x = y;
}
void checkmax(long long &x, long long y) {
  if (x < y) x = y;
}
inline int read() {
  int x = 0, f = 1;
  char c = getchar();
  while (c > '9' || c < '0') {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9')
    x = (x << 1) + (x << 3) + (c ^ 48), c = getchar();
  return x * f;
}
const int N = 100005;
int n, k, cnt[N];
char s[N];
void Win() {
  puts("tokitsukaze");
  exit(0);
}
void Lose() {
  puts("quailty");
  exit(0);
}
void Tie() {
  puts("once again");
  exit(0);
}
int main() {
  n = read();
  k = read();
  scanf("%s", s + 1);
  for (int i = 1; i <= n; i++) cnt[i] = cnt[i - 1] + s[i] - '0';
  for (int i = 1; i <= n - k + 1; i++) {
    if (!cnt[i - 1] && !(cnt[n] - cnt[i + k - 1])) Win();
    if (cnt[i - 1] == i - 1 && cnt[n] - cnt[i + k - 1] == n - (i + k - 1))
      Win();
  }
  int f0 = inf, f1 = inf, b0 = 0, b1 = 0;
  for (int i = 1; i <= n; i++) {
    if (s[i] == '0')
      checkmin(f0, i), checkmax(b0, i);
    else
      checkmin(f1, i), checkmax(b1, i);
  }
  int cnt = 1, mx = 1;
  for (int i = 2; i <= n; i++) {
    if (s[i] == s[i - 1])
      cnt++;
    else
      cnt = 1;
    checkmax(mx, cnt);
  }
  if (b0 - f0 > k || b1 - f1 > k || mx >= k) Tie();
  Lose();
  return 0;
}
