#include <bits/stdc++.h>
using namespace std;
inline int getidx(const vector<int>& ar, int x) {
  return lower_bound(ar.begin(), ar.end(), x) - ar.begin();
}
inline long long GCD(long long a, long long b) {
  long long n;
  if (a < b) swap(a, b);
  while (b != 0) {
    n = a % b;
    a = b;
    b = n;
  }
  return a;
}
inline long long LCM(long long a, long long b) {
  if (a == 0 || b == 0) return GCD(a, b);
  return a / GCD(a, b) * b;
}
inline long long CEIL(long long n, long long d) {
  return n / d + (long long)(n % d != 0);
}
inline long long ROUND(long long n, long long d) {
  return n / d + (long long)((n % d) * 2 >= d);
}
const long long MOD = 1e9 + 7;
inline long long POW(long long a, long long n) {
  assert(0 <= n);
  long long ret;
  for (ret = 1; n; a = a * a % MOD, n /= 2) {
    if (n % 2) ret = ret * a % MOD;
  }
  return ret;
}
template <class T>
ostream& operator<<(ostream& os, vector<T> v) {
  os << "[";
  int cnt = 0;
  for (auto vv : v) {
    os << vv;
    if (++cnt < v.size()) os << ",";
  }
  return os << "]";
}
template <class T>
ostream& operator<<(ostream& os, set<T> v) {
  os << "[";
  int cnt = 0;
  for (auto vv : v) {
    os << vv;
    if (++cnt < v.size()) os << ",";
  }
  return os << "]";
}
template <class L, class R>
ostream& operator<<(ostream& os, pair<L, R> p) {
  return os << "(" << p.first << "," << p.second << ")";
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << H, debug_out(T...);
}
const int MAXN = 1e5 + 10;
const string WIN_STR[3] = {"tokitsukaze", "quailty", "once again"};
int n, k, ps[MAXN];
string ar;
void input() { cin >> n >> k >> ar; }
int sum(int s, int e, int x) {
  if (s > e) return 0;
  int ret = ps[e] - (s ? ps[s - 1] : 0);
  if (x == 0) return ret;
  return e - s + 1 - ret;
}
string generate_str(int s, int e, char x) {
  string ret = ar;
  for (int(i) = (s); (i) < (int)(e); ++(i)) ret[i] = x;
  return ret;
}
bool direct_win(const string& ar) {
  for (int(i) = (0); (i) < (int)(n); ++(i))
    ps[i] = (i ? ps[i - 1] : 0) + (ar[i] == '0');
  for (int(i) = (k - 1); (i) < (int)(n); ++(i)) {
    int s = i - k + 1, e = i;
    for (int(x) = (0); (x) < (int)(2); ++(x)) {
      if (sum(0, s - 1, x) + sum(e + 1, n - 1, x) == n - k) {
        return true;
      }
    }
  }
  return false;
}
bool flip_win(int s, int e, char x) {
  string t = generate_str(s, e, x);
  return direct_win(t);
}
bool erase_between_win(char x) {
  int s = -1, e = -1;
  for (int(i) = (0); (i) < (int)(n); ++(i))
    if (ar[i] == x) {
      if (s == -1) s = i;
      e = i;
    }
  return e - s + 1 < k + 2;
}
int solve() {
  if (direct_win(ar)) {
    cout << WIN_STR[0] << '\n';
    return 0;
  }
  if (erase_between_win('0') && erase_between_win('1') && flip_win(0, k, '0') &&
      flip_win(n - k, n, '0') && flip_win(0, k, '1') &&
      flip_win(n - k, n, '1')) {
    cout << WIN_STR[1] << '\n';
    return 0;
  }
  cout << WIN_STR[2] << '\n';
  return 0;
}
void execute() { input(), solve(); }
int main(void) {
  cin.tie(0), ios_base::sync_with_stdio(false);
  execute();
  return 0;
}
