#include <bits/stdc++.h>
using namespace std;
const long long mod = 998244353;
const long long INF = mod * mod;
const long double eps = 1e-8;
void solve() {
  int n, k;
  cin >> n >> k;
  string s;
  cin >> s;
  vector<int> loc[2];
  for (int i = 0; i < n; i++) {
    if (s[i] == '0')
      loc[0].push_back(i);
    else
      loc[1].push_back(i);
  }
  for (int i = 0; i < n - k + 1; i++) {
    for (int j = 0; j < 2; j++) {
      int c = lower_bound(loc[j].begin(), loc[j].end(), i) - loc[j].begin();
      if (c == 0) {
        c = lower_bound(loc[j].begin(), loc[j].end(), i + k) - loc[j].begin();
        if (c == loc[j].size()) {
          cout << "tokitsukaze" << endl;
          return;
        }
      }
    }
  }
  for (int i = 0; i < n - k + 1; i++) {
    for (int j = 0; j < 2; j++) {
      int le = loc[j][0];
      if (i <= le && le < i + k) {
        le = lower_bound(loc[j].begin(), loc[j].end(), i + k) - loc[j].begin();
        le = loc[j][le];
      }
      int ri = loc[j].back();
      if (i <= ri && ri < i + k) {
        ri = lower_bound(loc[j].begin(), loc[j].end(), i) - loc[j].begin();
        ri--;
        ri = loc[j][ri];
      }
      if (ri - le >= k) {
        cout << "once again" << endl;
        return;
      }
    }
  }
  cout << "quailty" << endl;
}
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  solve();
  return 0;
}
