#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, k;
  cin >> n >> k;
  string a;
  cin >> a;
  int left1 = -1, right1 = -1, left0 = -1, right0 = -1;
  for (int i = 0; i < n; i++) {
    if (a[i] == '1' && left1 == -1) {
      left1 = i;
    }
    if (a[i] == '0' && left0 == -1) {
      left0 = i;
    }
  }
  for (int i = n - 1; i >= 0; i--) {
    if (a[i] == '1' && right1 == -1) {
      right1 = i;
    }
    if (a[i] == '0' && right0 == -1) {
      right0 = i;
    }
  }
  int test = min(right1 - left1 + 1, right0 - left0 + 1);
  if (test <= k) {
    cout << "tokitsukaze" << endl;
    return 0;
  }
  if ((right1 == n - 1 && left1 == 0) || (right0 == n - 1 && left0 == 0)) {
    cout << "once again" << endl;
    return 0;
  }
  if (max(left1, left0) - min(left1, left0) >= k ||
      max(right1, right0) - min(right1, right0) >= k) {
    cout << "once again" << endl;
    return 0;
  }
  if (max(right1 - left1 + 1, right0 - left0 + 1) >= k + 2) {
    cout << "once again" << endl;
    return 0;
  }
  cout << "quailty" << endl;
}
