#include <bits/stdc++.h>
using namespace std;
template <class U, class T>
void Max(U &first, T second) {
  if (first < second) first = second;
}
template <class U, class T>
void Min(U &first, T second) {
  if (first > second) first = second;
}
template <class T>
void add(int &a, T b) {
  a = (a + b) % 1000000007;
}
inline int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
inline long long gcd(long long a, long long b) {
  return b == 0 ? a : gcd(b, a % b);
}
int pow(int a, int b) {
  int ans = 1;
  while (b) {
    if (b & 1) ans = 1LL * ans * a % 1000000007;
    a = 1LL * a * a % 1000000007;
    b >>= 1;
  }
  return ans;
}
int pow(int a, int b, int c) {
  int ans = 1;
  while (b) {
    if (b & 1) ans = 1LL * ans * a % c;
    a = 1LL * a * a % c;
    b >>= 1;
  }
  return ans;
}
int a[100010];
char s[100010];
int main() {
  int T, ca = 0, k, i, j, m = 0, K = 0, n;
  scanf("%d%d%s", &n, &K, s);
  for (int i = 0; i < n; i++) {
    a[i + 1] = a[i] + (s[i] == '1');
  }
  int b[2][2];
  memset(b, -1, sizeof(b));
  for (int i = 0; i < n; i++) {
    k = s[i] - '0';
    b[k][1] = i;
    if (b[k][0] == -1) b[k][0] = i;
  }
  for (int i = 0; i < n - K + 1; i++) {
    if (a[i] == i && a[n] - a[i + K] == n - i - K) {
      puts("tokitsukaze");
      return 0;
    }
    if (a[i] == 0 && a[n] - a[i + K] == 0) {
      puts("tokitsukaze");
      return 0;
    }
  }
  for (int i = 0; i < n - K + 1; i++) {
    int bad = 0;
    k = b[0][1];
    if (a[i] == i) {
      k -= K;
      if (k < i + K || a[k + 1] - a[i + K] == k + 1 - i - K) bad = 1;
    }
    k = b[0][0];
    if (a[n] - a[i + K] == n - i - K) {
      k += K;
      if (k >= i || a[i] - a[k] == i - k) bad = 1;
    }
    if (bad == 0) {
      puts("once again");
      return 0;
    }
    bad = 0;
    k = b[1][1];
    if (a[i] == 0) {
      k -= K;
      if (k < i + K || a[k + 1] - a[i + K] == 0) bad = 1;
    }
    k = b[0][0];
    if (a[n] - a[i + K] == 0) {
      k += K;
      if (k >= i || a[i] - a[k] == 0) bad = 1;
    }
    if (bad == 0) {
      puts("once again");
      return 0;
    }
  }
  puts("quailty");
}
