Ainta Game

Koosaga and cubelover play the Ainta game. The game starts with one chess piece on an $N \times M$ board. The piece is called "Ainta", a piece modeled after Ainta itself. Ainta can move down one square or right one square. Ainta also has an integer $k$ written on it, and it can move $k$ squares diagonally down and right. In other words, if Ainta is at $(r, c)$, it can move in one step to $(r+1, c)$, $(r, c+1)$, or $(r+k, c+k)$. Ainta cannot move off the board.

At the start, Ainta is on the top-left square. The two players take turns moving Ainta once each. The player who cannot move Ainta any further loses.

Write a program that determines who wins when both players play optimally. Koosaga moves first.

The first line contains the number of test cases $T$ ($1 \le T \le 100{,}000$). Each of the next $T$ lines contains one test case, consisting of $K$, $N$, and $M$ ($1 \le K, N, M \le 10^9$).

For each test case, print the winner. Print "koosaga" if Koosaga wins, or "cubelover" if cubelover wins.