#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using ld = long double;
const int mod = 1e9 + 7;
const ll inf = 2e9;
const ll INF = 2e18;
const ld EPS = 1e-7;
const int N = 1e5 + 33;
int p[N];
int a[N];
int sum(int l, int r) { return p[r] - p[l - 1]; }
void solve() {
  int n, k;
  cin >> n >> k;
  for (int i = 1; i <= n; ++i) {
    char c;
    cin >> c;
    a[i] = c == '1';
    p[i] = p[i - 1] + a[i];
  }
  for (int i = 1; i + k - 1 <= n; ++i) {
    int cnt = p[n] - sum(i, i + k - 1);
    if (!cnt || cnt == n - k) {
      cout << "tokitsukaze";
      return;
    }
  }
  for (int rep = 1; rep <= 2; ++rep) {
    set<int> bl, wh;
    for (int i = 1; i <= n; ++i) {
      a[i] ^= 1;
      p[i] = a[i] + p[i - 1];
      if (a[i])
        bl.insert(i);
      else
        wh.insert(i);
    }
    for (int i = 1; i < k; ++i) {
      if (a[i]) bl.erase(i);
      wh.insert(i);
    }
    for (int i = 1; i + k - 1 <= n; ++i) {
      if (a[i + k - 1]) bl.erase(i);
      wh.insert(i + k - 1);
      int wl = *wh.begin();
      int wr = *wh.rbegin();
      int ql = *bl.begin();
      int qr = *bl.rbegin();
      if (qr - ql > k && wr - wl > k) {
        cout << "once again";
        return;
      }
      if (a[i]) bl.insert(i), wh.erase(i);
    }
  }
  if (2 * k >= n) {
    cout << "quailty";
    return;
  }
  cout << "once again";
}
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  ;
  int tt = 1;
  while (tt--) {
    solve();
    cout << "\n";
  }
}
