#include <iostream>
using namespace std;
typedef long long int ll;
void solve()
{
ll m, n;
cin >> m >> n;
ll tsondu = 0;
ll input;
for (int i = 0; i < m; i++)
{
cin >> input;
tsondu += input;
}
for (int i = 0; i < n; i++)
{
cin >> input;
tsondu -= input;
}
if (tsondu > 0)
cout << "Tsondu" << endl;
else if (tsondu < 0)
cout << "Tenzing" << endl;
else
cout << "Draw" << endl;
}
/// @brief
/// @return
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
int t;
cin >> t;
while (t--)
solve();
}
17. Letter Combinations of a Phone Number | 5. Longest Palindromic Substring |
3. Longest Substring Without Repeating Characters | 1312. Minimum Insertion Steps to Make a String Palindrome |
1092. Shortest Common Supersequence | 1044. Longest Duplicate Substring |
1032. Stream of Characters | 987. Vertical Order Traversal of a Binary Tree |
952. Largest Component Size by Common Factor | 212. Word Search II |
174. Dungeon Game | 127. Word Ladder |
123. Best Time to Buy and Sell Stock III | 85. Maximal Rectangle |
84. Largest Rectangle in Histogram | 60. Permutation Sequence |
42. Trapping Rain Water | 32. Longest Valid Parentheses |
Cutting a material | Bubble Sort |
Number of triangles | AND path in a binary tree |
Factorial equations | Removal of vertices |
Happy segments | Cyclic shifts |
Zoos | Build a graph |
Almost correct bracket sequence | Count of integers |