B'Tsondu and Tenzing are playing a card game. Tsondu has n monsters with ability values a_1, a_2, ldots, a_n while Tenzing has m monsters with ability values b_1, b_2, ldots, b_m . Tsondu and Tenzing take turns making moves, with Tsondu going first. In each move, the current player chooses two monsters: one on their side and one on the other side. Then, these monsters will fight each other. Suppose the ability values for the chosen monsters are x and y respectively, then the ability values of the monsters will become x-y and y-x respectively. If the ability value of any monster is smaller than or equal to 0 , the monster dies. The game ends when at least one player has no monsters left alive. The winner is the player with at least one monster left alive. If both players have no monsters left alive, the game ends in a draw. Find the result of the game when both players play optimally. Each test contains multiple test cases. The first line of input contains a single integer t ( 1 <= t <= 2 cdot 10^3 ) -- the number of test cases. The description of test cases follows. The first line of each test case contains two integers n and m ( 1 <= q n,m <= q 50 ) -- the number of monsters Tsondu and Tenzing have respectively. The second line of each test case contains n integers a_1,a_2, ldots,a_n (1 <= q a_i <= q 10^9 ) -- the ability values of Tsondu 's monsters. The third line of each test case contains m integers b_1,b_2, ldots,b_m (1 <= q b_i <= q 10^9 ) -- the ability values of Tenzing 's monsters. For each test case, output "Tsondu" if Tsondu wins, "Tenzing" if Tenzing wins, and "Draw" if the game ends in a draw. (Output without quotes.) Note that the output is case-sensitive. For example, if the answer is "Tsondu", the outputs "tsondu", "TSONDU", and "tSonDu" will all be recognized as incorrect outputs. Consider the first test case. It can '...