#include <bits/stdc++.h>
using namespace std;
long long n, k;
long long a[200010], b[200010], sum[200010];
long long searchleft0(long long l, long long r) {
  long long mid, p = sum[l - 1], now, ll = l, rr = r;
  while (rr > ll) {
    mid = (ll + rr) / 2;
    now = p + mid - l + 1;
    if (sum[mid] == now)
      ll = mid + 1;
    else
      rr = mid;
  }
  mid = (ll + rr) / 2;
  if (sum[mid] - sum[mid - 1] != 0)
    return -1;
  else
    return mid;
}
long long searchright0(long long l, long long r) {
  long long mid, p = sum[r], now, ll = l, rr = r;
  while (rr > ll) {
    mid = (ll + rr) / 2;
    now = p - r + mid;
    if (sum[mid] == now)
      rr = mid;
    else
      ll = mid + 1;
  }
  if (sum[rr] - sum[rr - 1] == 0)
    mid = rr;
  else
    mid = ll;
  if (sum[mid] - sum[mid - 1] != 0)
    return -1;
  else
    return mid;
}
long long searchleft1(long long l, long long r) {
  long long mid, now = sum[l - 1], ll = l, rr = r;
  while (rr > ll) {
    mid = (ll + rr) / 2;
    if (sum[mid] == now)
      ll = mid + 1;
    else
      rr = mid;
  }
  mid = (ll + rr) / 2;
  if (sum[mid] - sum[mid - 1] != 1)
    return -1;
  else
    return mid;
}
long long searchright1(long long l, long long r) {
  long long mid, now = sum[r], ll = l, rr = r;
  while (rr > ll) {
    mid = (ll + rr) / 2;
    if (sum[mid] == now)
      rr = mid;
    else
      ll = mid + 1;
  }
  if (sum[rr] - sum[rr - 1] == 1)
    mid = rr;
  else
    mid = ll;
  if (sum[mid] - sum[mid - 1] != 1)
    return -1;
  else
    return mid;
}
bool check(long long l, long long r, long long x) {
  long long left0, left1, right0, right1, len0, len1;
  if (l == 0 && r == 0) {
    left0 = searchleft0(1, n);
    left1 = searchleft1(1, n);
    right0 = searchright0(1, n);
    right1 = searchright1(1, n);
  } else {
    if (x == 0) {
      left0 = min(l, searchleft0(1, n));
      right0 = max(r, searchright0(1, n));
      if (searchleft1(1, n) >= l)
        left1 = searchleft1(r + 1, n);
      else
        left1 = searchleft1(1, n);
      if (searchright1(1, n) <= r)
        right1 = searchright1(1, l - 1);
      else
        right1 = searchright1(1, n);
    } else {
      left1 = min(l, searchleft1(1, n));
      right1 = max(r, searchright1(1, n));
      if (searchleft0(1, n) >= l)
        left0 = searchleft0(r + 1, n);
      else
        left0 = searchleft0(1, n);
      if (searchright0(1, n))
        right0 = searchright0(1, l - 1);
      else
        right0 = searchright0(1, n);
    }
  }
  if (left0 != -1 && right0 != -1)
    len0 = right0 - left0 + 1;
  else
    len0 = 0;
  if (left1 != -1 && right1 != -1)
    len1 = right1 - left1 + 1;
  else
    len1 = 0;
  if (len0 <= k || len1 <= k)
    return true;
  else
    return false;
}
int main() {
  long long i, j, l;
  string s;
  cin >> n >> k;
  cin >> s;
  for (i = 0; i < n; i++) a[i + 1] = s[i] - 48;
  sum[0] = 0;
  for (i = 1; i <= n; i++) sum[i] = sum[i - 1] + a[i];
  if (check(0, 0, 0)) {
    cout << "tokitsukaze\n";
    return 0;
  }
  bool f = true;
  for (i = 1; i <= n - k + 1; i++) {
    f = check(i, i + k - 1, 0);
    if (!f) break;
    f = check(i, i + k - 1, 1);
    if (!f) break;
  }
  if (f)
    cout << "quailty\n";
  else
    cout << "once again\n";
  return 0;
}
