#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
char s[N];
vector<int> p[2];
int n, k;
int fun(int L, int R, int x) {
  int tL = n + 1, tR = -1;
  x ^= 1;
  int pos = lower_bound(p[x].begin(), p[x].end(), L) - p[x].begin();
  if (pos != 0) {
    tL = p[x][0];
    tR = p[x][pos - 1];
  }
  pos = upper_bound(p[x].begin(), p[x].end(), R) - p[x].begin();
  if (pos < p[x].size()) {
    tL = min(tL, p[x][pos]);
    tR = max(tR, p[x][p[x].size() - 1]);
  }
  if (tR == -1) return 0;
  if (tR - tL + 1 <= k) return 1;
  return 2;
}
int main() {
  scanf("%d %d %s", &n, &k, s + 1);
  for (int i = 1; i <= n; i++) {
    p[s[i] - '0'].push_back(i);
  }
  int ans = 1;
  for (int i = 1; i + k - 1 <= n; i++) {
    for (int j = 0; j < 2; j++) {
      int tmp = fun(i, i + k - 1, j);
      if (tmp == 0) {
        ans = 0;
      } else if (ans != 0 && tmp == 2) {
        ans = 2;
      }
    }
  }
  if (ans == 0) {
    printf("tokitsukaze\n");
  } else if (ans == 1) {
    printf("quailty\n");
  } else {
    printf("once again\n");
  }
  return 0;
}
