#include <bits/stdc++.h>
using namespace std;
struct node {
  int lpos[2], rpos[2];
} pool[810000];
int n, k;
char s[810000];
void build(int pos, int l, int r) {
  if (l == r) {
    if (s[l - 1] == '1') {
      pool[pos].lpos[1] = pool[pos].rpos[1] = l;
      pool[pos].lpos[0] = 0x3f3f3f3f;
      pool[pos].rpos[0] = -0x3f3f3f3f;
    } else {
      pool[pos].lpos[0] = pool[pos].rpos[0] = l;
      pool[pos].lpos[1] = 0x3f3f3f3f;
      pool[pos].rpos[1] = -0x3f3f3f3f;
    }
    return;
  }
  build((pos << 1), l, (l + r) / 2);
  build((pos << 1 | 1), (l + r) / 2 + 1, r);
  pool[pos].lpos[0] =
      min(pool[(pos << 1)].lpos[0], pool[(pos << 1 | 1)].lpos[0]);
  pool[pos].lpos[1] =
      min(pool[(pos << 1)].lpos[1], pool[(pos << 1 | 1)].lpos[1]);
  pool[pos].rpos[0] =
      max(pool[(pos << 1)].rpos[0], pool[(pos << 1 | 1)].rpos[0]);
  pool[pos].rpos[1] =
      max(pool[(pos << 1)].rpos[1], pool[(pos << 1 | 1)].rpos[1]);
}
pair<int, int> query(int pos, int p, int ql, int qr, int l, int r) {
  if (qr < l || ql > r) return {0x3f3f3f3f, -0x3f3f3f3f};
  if (qr >= r && ql <= l) return {pool[pos].lpos[p], pool[pos].rpos[p]};
  pair<int, int> p1 = query((pos << 1), p, ql, qr, l, (l + r) / 2);
  pair<int, int> p2 = query((pos << 1 | 1), p, ql, qr, (l + r) / 2 + 1, r);
  return {min(p1.first, p2.first), max(p1.second, p2.second)};
}
int main() {
  cin >> n >> k;
  cin >> s;
  build(1, 1, n);
  pair<int, int> pp;
  pp = query(1, 1, 1, n, 1, n);
  if (pp.second - pp.first <= k - 1) {
    cout << "tokitsukaze";
    return 0;
  }
  pp = query(1, 0, 1, n, 1, n);
  if (pp.second - pp.first <= k - 1) {
    cout << "tokitsukaze";
    return 0;
  }
  bool f = true;
  pair<int, int> p1, p2;
  for (register int i = (1); i < (n - k + 1); i++) {
    p1 = query(1, 1, 1, i - 1, 1, n);
    p2 = query(1, 1, i + k, n, 1, n);
    if (max(p1.second, p2.second) - min(p1.first, p2.first) > k - 1) {
      f = false;
      break;
    }
    p1 = query(1, 0, 1, i - 1, 1, n);
    p2 = query(1, 0, i + k, n, 1, n);
    if (max(p1.second, p2.second) - min(p1.first, p2.first) > k - 1) {
      f = false;
      break;
    }
  }
  if (f) {
    cout << "quailty";
    return 0;
  }
  cout << "once again";
  return 0;
  return ~~(0 ^ 0 ^ 0);
}
