#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const int C = 26;
void add(int &x, int y) {
  x += y;
  while (x >= MOD) x -= MOD;
  while (x < 0) x += MOD;
}
int fix(int x) {
  while (x >= MOD) x -= MOD;
  while (x < 0) x += MOD;
  return x;
}
int pw(int a, int b) {
  int ret = 1;
  while (b) {
    if (b & 1) ret = 1ll * ret * a % MOD;
    b >>= 1;
    a = 1ll * a * a % MOD;
  }
  return ret;
}
const int MAXN = 1e6 + 10;
const string WIN = "tokitsukaze";
const string LOSE = "quailty";
const string TIE = "once again";
int n, k;
string s;
void win() {
  for (int rep = 0; rep < 2; rep++) {
    string t = s;
    if (t == string(n, '0')) {
      cout << WIN << "\n";
      exit(0);
      return;
    }
    for (int i = 0; i < n; i++) {
      if (t[i] == '1') {
        for (int j = i; j < min(n, i + k); j++) {
          t[j] = '0';
        }
        if (t == string(n, '0')) {
          cout << WIN << "\n";
          exit(0);
        }
        break;
      }
    }
    for (int i = 0; i < n; i++) {
      s[i] ^= '0' ^ '1';
    }
  }
}
void solve() {
  cin >> n >> k;
  cin >> s;
  win();
  vector<int> pos[2];
  for (int i = 0; i < n; i++) {
    pos[s[i] - '0'].push_back(i);
  }
  for (int x = 0; x < 2; x++) {
    int m = pos[x].size();
    assert(m > 1);
    int len = pos[x][m - 1] - pos[x][0] - 1;
    if (len >= k) {
      cerr << "HE CANT WIN\n";
      cout << TIE << "\n";
      return;
    }
  }
  for (int l = 0, r = 0; l < n; l = r) {
    while (s[l] == s[r]) ++r;
    if (r - l >= k) {
      cerr << "STAY SAME\n";
      cout << TIE << "\n";
      return;
    }
  }
  cout << LOSE << "\n";
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int te = 1;
  for (int w = 1; w <= te; w++) {
    solve();
  }
  return 0;
}
