#include <bits/stdc++.h>
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize(4)
using namespace std;
const int N = 1e5 + 10;
int n, k, sum[N], suf[N];
char s[N];
int main() {
  scanf("%d %d", &n, &k);
  scanf("%s", s + 1);
  for (int i = 1; i <= n; ++i) sum[i] = sum[i - 1] + (s[i] == '1');
  for (int i = n; i >= 1; --i) suf[i] = suf[i + 1] + (s[i] == '1');
  for (int i = k; i <= n; ++i) {
    if (sum[i - k] == 0 && suf[i + 1] == 0) return 0 * puts("tokitsukaze");
    if (sum[i - k] + suf[i + 1] == n - k) return 0 * puts("tokitsukaze");
  }
  for (int i = k; i <= n; ++i) {
    if (suf[i + 1] == n - i && i - k <= k || sum[i - k] == i - k && n - i <= k)
      ;
    else
      return 0 * puts("once again");
    if (suf[i + 1] == 0 && i - k <= k || sum[i - k] == 0 && n - i <= k)
      ;
    else
      return 0 * puts("once again");
  }
  puts("quailty");
  return 0;
}
