---{"category_name":"school","problem_code":"EXAMTIME","problem_name":"TCS Examination","problemComponents":{"constraints":"- $1 \\leq T \\leq 1000$\n- Each score of both Dragon and Sloth lies between $0$ and $100$.","constraintsState":true,"subtasks":"**Subtask #1 (100 points):** Original constraints\n\n","subtasksState":true,"inputFormat":"- The first line of input contains a single integer $T$, denoting the number of test cases. The description of $T$ test cases follows.\n- The first line of each test case contains three space-separated integers denoting the scores of Dragon in $\\text{DSA}$, $\\text{TOC}$ and $\\text{DM}$ respectively. \n- The second line of each test case contains three space-separated integers denoting the scores of Sloth in $\\text{DSA}$, $\\text{TOC}$ and $\\text{DM}$ respectively. ","inputFormatState":true,"outputFormat":"- For each test case, if Dragon got a better rank then output `\u0022Dragon\u0022`, else if Sloth got a better rank then output `\u0022Sloth\u0022`. If there was a tie then output `\u0022Tie\u0022`. Note that the string you output should not contain quotes.\n- The output is **case insensitive**. For example, If the output is \u0022Tie\u0022 then \u0022TiE\u0022, \u0022tiE\u0022, \u0022tie\u0022, etc are also considered correct.\n","outputFormatState":true,"sampleTestCases":{"0":{"id":1,"input":"4\n10 20 30\n30 20 10\n5 23 87\n5 23 87\n0 15 100\n100 5 5\n50 50 50\n50 49 51\n","output":"SLOTH\nTIE\nDRAGON\nDRAGON","explanation":"- For the first test case, Sloth and Dragon have the same total score but Sloth gets a better rank because he has a higher score in $\\text{DSA}$.\n- For the second test case, Sloth and Dragon have the same rank because they have the same score among all subjects.\n- For the third test case, Dragon gets a better rank because he has a greater total score.\n- For the fourth test case, Sloth and Dragon have the same total score and same $\\text{DSA}$ score. Dragon gets a better rank because he has a greater $\\text{TOC}$ score.","isDeleted":false}}},"video_editorial_url":"https://youtu.be/9sa9EO0-nFI","languages_supported":{"0":"CPP14","1":"C","2":"JAVA","3":"PYTH 3.6","4":"CPP17","5":"PYTH","6":"PYP3","7":"CS2","8":"ADA","9":"PYPY","10":"TEXT","11":"PAS fpc","12":"NODEJS","13":"RUBY","14":"PHP","15":"GO","16":"HASK","17":"TCL","18":"PERL","19":"SCALA","20":"LUA","21":"kotlin","22":"BASH","23":"JS","24":"LISP sbcl","25":"rust","26":"PAS gpc","27":"BF","28":"CLOJ","29":"R","30":"D","31":"CAML","32":"FORT","33":"ASM","34":"swift","35":"FS","36":"WSPC","37":"LISP clisp","38":"SQL","39":"SCM guile","40":"PERL6","41":"ERL","42":"CLPS","43":"ICK","44":"NICE","45":"PRLG","46":"ICON","47":"COB","48":"SCM chicken","49":"PIKE","50":"SCM qobi","51":"ST","52":"SQLQ","53":"NEM"},"max_timelimit":1,"source_sizelimit":50000,"problem_author":"utkarsh_adm","problem_tester":"","date_added":"11-01-2022","tags":{"0":"cakewalk","1":"jan222","2":"utkarsh_adm"},"problem_difficulty_level":"Unavailable","best_tag":"","editorial_url":"https://discuss.codechef.com/problems/EXAMTIME","time":{"view_start_date":1642411800,"submit_start_date":1642411800,"visible_start_date":1642411800,"end_date":1735669800},"is_direct_submittable":false,"problemDiscussURL":"https://discuss.codechef.com/search?q=EXAMTIME","is_proctored":false,"visitedContests":{},"layout":"problem"}---This is an example statement in markdown. This is the statement of the problem [TANDC](https://codechef.com/problems/TANDC) on CodeChef. The main statement starts with the next paragraph. Please make sure to remove this paragraph from your statement before publishing your problem. If your problem doesn't contain Subtasks, you should remove the section subtask too. We are using markdown the syntax of which can be seen [at](https://github.com/showdownjs/showdown/wiki/Showdown's-Markdown-syntax). We request you to not use any HTML tags in the statement, e.g. no p, ul, li, pre, br or b tags. If you face any issue, please contact admins or email us at help@codechef.com.Tracy is teaching Charlie maths via a game called $N$-Cube, which involves three sections involving $N$.Tracy gives Charlie a number $N$, and Charlie makes a list of $N$-th powers of integers in increasing order $1^N, 2^N, 3^N, \dot, \text{so on}$. This teaches him exponentiation.Then Charlie performs the following subtraction game $N$ times: Take all pairs of consecutive numbers in the list and take their difference. These differences then form the new list for the next iteration of the game. Eg, if $N$ was 6, the list proceeds as $[1, 64, 729, 4096 ... ]$ to $[63, 685, 3367 ...]$, and so on $5$ more times.After the subtraction game, Charlie has to correctly tell Tracy the $N$-th element of the list. This number is the *value of the game*.After practice Charlie became an expert in the game. To challenge him more, Tracy will give two numbers $M$ (where $M$ is a prime) and $R$ instead of just a single number $N$, and the game must start from $M_R - 1$ instead of $N$. Since the *value of the game* can now become large, Charlie just have to tell the largest integer $K$ such that $M_K$ divides this number. Since even $K$ can be large, output $K$ modulo 1000000007 ($10^9 + 7$).<aside style='background: #f8f8f8;padding: 10px 15px;'><div>All submissions for this problem are available.</div></aside>