#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
char s[N];
int n, k, sum[N];
int fir[2], End[2];
int left_find(int pos, int col) {
  col = 1 - col;
  if (col == 1) {
    int l = 1, r = pos, ans = -1;
    while (l <= r) {
      int mid = (l + r) >> 1;
      if (sum[pos] - sum[mid - 1] == 0)
        r = mid - 1;
      else
        l = mid + 1, ans = mid;
    }
    return ans;
  } else {
    int l = 1, r = pos, ans = -1;
    while (l <= r) {
      int mid = (l + r) >> 1;
      if (sum[pos] - sum[mid - 1] == pos - mid + 1)
        r = mid - 1;
      else
        ans = mid, l = mid + 1;
    }
    return ans;
  }
}
int right_find(int pos, int col) {
  col = 1 - col;
  if (col == 1) {
    int l = pos, r = n, ans = -1;
    while (l <= r) {
      int mid = (l + r) >> 1;
      if (sum[mid] - sum[pos - 1] == 0)
        l = mid + 1;
      else
        r = mid - 1, ans = mid;
    }
    return ans;
  } else {
    int l = pos, r = n, ans = -1;
    while (l <= r) {
      int mid = (l + r) >> 1;
      if (sum[mid] - sum[pos - 1] == mid - pos + 1)
        l = mid + 1;
      else
        r = mid - 1, ans = mid;
    }
    return ans;
  }
}
int main() {
  scanf("%d%d", &n, &k);
  scanf("%s", s + 1);
  int len = strlen(s + 1);
  for (int i = 1; i <= len; i++) {
    sum[i] = sum[i - 1] + (s[i] == '1');
  }
  fir[0] = fir[1] = End[0] = End[1] = -1;
  for (int i = 1; i <= len; i++)
    if (s[i] == '0') {
      fir[0] = i;
      break;
    }
  for (int i = 1; i <= len; i++)
    if (s[i] == '1') {
      fir[1] = i;
      break;
    }
  for (int i = len; i >= 1; i--)
    if (s[i] == '0') {
      End[0] = i;
      break;
    }
  for (int i = len; i >= 1; i--)
    if (s[i] == '1') {
      End[1] = i;
      break;
    }
  for (int i = 1; i <= n - k + 1; i++)
    for (int c = 0; c <= 1; c++) {
      if ((fir[c] == -1 || fir[c] >= i && fir[c] <= i + k - 1) &&
          (End[c] == -1 || End[c] >= i && End[c] <= i + k - 1)) {
        puts("tokitsukaze");
        return 0;
      }
    }
  bool flag = true;
  for (int i = 1; i <= n - k + 1; i++)
    for (int c = 0; c <= 1; c++) {
      int s = left_find(i - 1, c);
      int t = right_find(i + k, c);
      if (s == -1) {
        s = t;
        t = End[c];
        if (t - s + 1 > k) flag = false;
      } else if (t == -1) {
        t = s;
        s = fir[c];
        if (t - s + 1 > k) flag = false;
      } else {
        if (End[c] - fir[c] + 1 > k) flag = false;
      }
    }
  if (flag) {
    puts("quailty");
    return 0;
  }
  puts("once again");
  return 0;
}
