#include <bits/stdc++.h>
using namespace std;
const long long int MOD = 1000000007;
const long long BIG = 1446803456761533460LL;
const int Big = 336860180;
const long long int INF = LONG_LONG_MAX;
const vector<vector<long long int> > adj4({{0, 1}, {0, -1}, {1, 0}, {-1, 0}});
const vector<vector<long long int> > adj8(
    {{0, 1}, {0, -1}, {1, 0}, {-1, 0}, {-1, -1}, {1, -1}, {-1, 1}, {1, 1}});
long long int gcd(long long int a, long long int b) {
  return b == 0 ? a : gcd(b, a % b);
}
long long int powMod(long long int a, long long int b, long long int mod) {
  long long int n = 1;
  long long int p = a;
  while (b > 0) {
    if (b % 2 == 1) {
      n *= p;
      n %= mod;
    }
    p *= p;
    p %= mod;
    b /= 2;
  }
  return n;
}
long long int modularInverse(long long int a, long long int mod) {
  return powMod(a, mod - 2, mod);
}
long long int binarysearch(long long int l, long long int r,
                           bool (*bsfunction)(long long int)) {
  while (r - l > 1) {
    long long int mid = (l + r) / 2;
    bool val = bsfunction(mid);
    if (val) {
      r = mid;
    } else {
      l = mid;
    }
  }
  return l;
}
stringstream sss;
const long long int maxn = 100010;
string s;
long long int lt0[maxn];
long long int rt0[maxn];
long long int lt1[maxn];
long long int rt1[maxn];
void MAIN() {
  long long int n, k;
  cin >> n >> k;
  cin >> s;
  lt0[0] = s[0] == '0' ? 0 : -1;
  lt1[0] = s[0] == '1' ? 0 : -1;
  for (long long int i = (1); i < (n); ++i) {
    if (s[i] == '0') {
      lt0[i] = i;
      lt1[i] = lt1[i - 1];
    } else {
      lt0[i] = lt0[i - 1];
      lt1[i] = i;
    }
  }
  rt0[n - 1] = s[n - 1] == '0' ? n - 1 : n;
  rt1[n - 1] = s[n - 1] == '1' ? n - 1 : n;
  for (long long int i = (n - 1) - 1; i >= (0); --i) {
    if (s[i] == '0') {
      rt0[i] = i;
      rt1[i] = rt1[i + 1];
    } else {
      rt0[i] = rt0[i + 1];
      rt1[i] = i;
    }
  };
  ;
  ;
  ;
  if (lt0[n - 1] - rt0[0] + 1 <= k || lt1[n - 1] - rt1[0] + 1 <= k) {
    cout << ("tokitsukaze") << '\n';
    return;
  }
  for (long long int i = 0; i < (n - k + 1); ++i) {
    long long int l0 = rt1[0] < i ? rt1[0] : rt1[i + k];
    long long int r0 = lt1[n - 1] > i + k - 1 ? lt1[n - 1] : lt1[i - 1];
    long long int l1 = rt0[0] < i ? rt0[0] : rt0[i + k];
    long long int r1 = lt0[n - 1] > i + k - 1 ? lt0[n - 1] : lt0[i - 1];
    ;
    ;
    if (r0 - l0 + 1 <= k && r1 - l1 + 1 <= k) {
    } else {
      cout << ("once again") << '\n';
      return;
    }
  }
  cout << ("quailty") << '\n';
}
long long int TESTCASEN = 1;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout << fixed << setprecision(10);
  sss << R"(
4 1
0011
6 5
010101
6 1
010101
4 2
0101
    )";
  for (long long int test = 0; test < (TESTCASEN); ++test) {
    MAIN();
  }
  return 0;
}
