Winner QAQ

Time Limit: 1000 ms Memory Limit: 65536 KiB

Problem Description

QAQ is an ACM winner, as he has raised seven silver medals and one bronze medal in all kinds of ACM contests. What's more, now he is confident to get a gold medal in the Qingdao regional. In addition, QAQ is also a chess winner. He is a so skillful chess player, and a normal chess game is too simple for him. So he invents a new chess game:

The size of chessboard is n*m. The top left corner is numbered (1, 1) and the lower right corner is numbered (n, m). You have a chess, and you can move the chess right, down, or lower right one unit each step. Also it can't be moved to the outside of chessboard.

For each game, the two players take turns moving a chess piece (QAQ always first) and they both play in an optimal strategy. At first, the chess piece is located at (1, 1). And the winner is the person who first moves the chess piece to (n, m).

Even though, QAQ still think this game is too simple, can you tell him if he can win the game?


In the first line, there is an integer T (1 <= T <= 10000) as the case number.
For each case, there are two integers n, m (1 <= n, m <= 10^9) that means the size of chessboard (the lower right corner).


For each case, there is only one line, if QAQ can win, print "that's too simple!", and if he can't, print "QAQ" (without quotes).

Sample Input

1 1
2 2
1 3
3 3
4 5

Sample Output

that's too simple!
that's too simple!
that's too simple!


For the first case, because QAQ first moves, and the chess is in the position (1, 1), so QAQ wins.
For the second case, because QAQ first moves, he can move the chess lower right one unit, then he reaches the point (2, 2), so QAQ wins.
For the third case, QAQ can only move right one unit, and then his opponent can move right one unit too. Then his opponent reaches the point (1, 3), so QAQ loses.


【第八届山东理工大学ACM网络编程擂台赛 正式赛】Johsnows