#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 1;
int n, k;
bool a[N];
int lft, rgt;
int main() {
  ios_base::sync_with_stdio(false);
  cout.tie(0);
  cin.tie(0);
  cin >> n >> k;
  for (int i = 0; i < n; ++i) {
    char c;
    cin >> c;
    a[i] = (c == '1');
  }
  for (int i = k; i < n; ++i) rgt += a[i];
  bool can_win_2 = (2 * k >= n);
  if (lft + rgt == 0 || lft + rgt == n - k) {
    cout << "tokitsukaze\n";
    return 0;
  }
  for (int i = 0; i + k < n; ++i) {
    lft += a[i];
    rgt -= a[i + k];
    if (lft + rgt == 0 || lft + rgt == n - k) {
      cout << "tokitsukaze\n";
      return 0;
    }
    if (i + k == n - 1) continue;
    if ((lft != i + 1 && lft != 0) || (rgt != n - i - k - 1 && rgt != 0))
      can_win_2 = false;
  }
  cout << (can_win_2 ? "quailty" : "once again") << '\n';
}
