#include <bits/stdc++.h>
using namespace std;
long long int n, m;
long long int arr[300000];
long long int dp[3000][3000];
string st;
array<long long int, 2> pref[300000];
array<long long int, 2> suff[300000];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  ;
  long long int TESTS, q, a, s, b, r, l, k, c, p, h, w, d, x, y, z, xs, ys, t;
  TESTS = 1;
  memset(pref, 0, sizeof(pref));
  memset(suff, 0, sizeof(suff));
  while (TESTS--) {
    cin >> n >> k;
    cin >> st;
    pref[0][st[0] - '0']++;
    for (long long int i = 1; i <= n - 1; i++) {
      pref[i] = pref[i - 1];
      pref[i][st[i] - '0']++;
    }
    suff[n - 1][st[n - 1] - '0']++;
    for (long long int i = n - 2; i >= 0; i--) {
      suff[i] = suff[i + 1];
      suff[i][st[i] - '0']++;
    }
    bool pos = false;
    for (long long int i = 0; i <= n - k; i++) {
      if (i == 0) {
        if (suff[i + k][0] == n - k || suff[i + k][1] == n - k) pos = true;
      } else {
        if (suff[i + k][0] + pref[i - 1][0] == n - k ||
            suff[i + k][1] + pref[i - 1][1] == n - k)
          pos = true;
      }
    }
    if (pos) {
      cout << "tokitsukaze";
      return 0;
    }
    for (long long int i = 1; i <= n - k - 1; i++) {
      if (2 * k < n) pos = true;
      if (suff[i + k][0] + pref[i - 1][1] != n - k &&
          suff[i + k][1] + pref[i - 1][0] != n - k)
        pos = true;
    }
    if (pos) {
      cout << "once again";
      return 0;
    }
    cout << "quailty";
  }
  return 0;
}
