#include <bits/stdc++.h>
inline long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
inline void sub(long long &a, long long b) {
  a -= b;
  if (a < 0) a += 1000000007;
}
inline void add(long long &a, long long b) {
  a += b;
  if (a >= 1000000007) a -= 1000000007;
}
template <typename T>
inline T const &MAX(T const &a, T const &b) {
  return a > b ? a : b;
}
template <typename T>
inline T const &MIN(T const &a, T const &b) {
  return a < b ? a : b;
}
inline long long mul(long long a, long long b, long long c) {
  return (a * b - (long long)((long double)a * b / c) * c + c) % c;
}
inline long long qp(long long a, long long b) {
  long long ans = 1;
  while (b) {
    if (b & 1) ans = ans * a % 1000000007;
    a = a * a % 1000000007, b >>= 1;
  }
  return ans;
}
inline long long qp(long long a, long long b, long long c) {
  long long ans = 1;
  while (b) {
    if (b & 1) ans = mul(ans, a, c);
    a = mul(a, a, c), b >>= 1;
  }
  return ans;
}
using namespace std;
const long double pi = acos(-1);
const unsigned long long ba = 233;
const double eps = 1e-5;
const long long INF = 0x3f3f3f3f3f3f3f3f;
const int N = 100000 + 10, maxn = 2000000 + 10, inf = 0x3f3f3f3f;
vector<int> v[2];
char s[N];
int a[N], pre[N][2], suf[N][2];
int main() {
  int n, k;
  scanf("%d%d%s", &n, &k, s + 1);
  for (int i = 1; i <= n; i++) v[s[i] - '0'].push_back(i);
  for (int i = 1; i <= n; i++)
    for (int j = 0; j < 2; j++) pre[i][j] = pre[i - 1][j] + (s[i] == '0' + j);
  for (int i = n; i >= 1; i--)
    for (int j = 0; j < 2; j++) suf[i][j] = suf[i + 1][j] + (s[i] == '0' + j);
  if (pre[n][0] == n || pre[n][1] == n) return 0 * puts("tokitsukaze");
  for (int i = 1; i + k - 1 <= n; i++)
    for (int j = 0; j < 2; j++)
      if (pre[i - 1][j] + suf[i + k][j] == n - k)
        return 0 * puts("tokitsukaze");
  for (int i = 1; i + k - 1 <= n; i++)
    for (int j = 0; j < 2; j++) {
      int x = v[j].front(), y = v[j].back();
      x = min(x, i);
      y = max(y, i + k - 1);
      int a = v[j ^ 1].back();
      if (i <= a && a <= i + k - 1) {
        a = lower_bound(v[j ^ 1].begin(), v[j ^ 1].end(), i) - v[j ^ 1].begin();
        a--;
        a = v[j ^ 1][a];
      }
      int b = v[j ^ 1].front();
      if (i <= b && b <= i + k - 1) {
        b = lower_bound(v[j ^ 1].begin(), v[j ^ 1].end(), i + k) -
            v[j ^ 1].begin();
        b = v[j ^ 1][b];
      }
      if (y - x >= k && a - b >= k) return 0 * puts("once again");
    }
  puts("quailty");
  return 0;
}
