D. Do and Tak Game
time limit per test
1 second
memory limit per test
256 megabytes
input
dotak.in
output
standard output

"I was going with a "Do", but I think you guys are going for a "Tak"" said Teemo.

Teemo and Omda are playing Do and Tak Game.

The rules of Do and Tak are simple. Just stand in a circle and $$$\dots$$$ Oh wait wrong game.

Initially, We have $$$N \times K$$$ chips. A player can make one of two moves :

  • Use a Do, i.e remove $$$K$$$ chips. You can only use a Do if the current number of chips is $$$\ge K$$$
  • Use a Tak, i.e remove $$$1$$$ chip.

The one who removes all chips first wins. If Omda starts playing, can you figure out who will win this game?

Input

The first line contains the number of test cases $$$T$$$ $$$(1 \leq T \leq 10^5)$$$.

The only line of each test case contains two integers $$$N$$$ and $$$K$$$ $$$(1 \leq N, K \leq 10^5)$$$.

Output

For each test case print "Omda" if Omda wins otherwise, print "Teemo".

Example
Input
2
10 20
2 2
Output
Omda
Omda