\includegraphics{https://static.e-olymp.com/content/ad/add0458e1ed9109f0825a776121ea5931fbf5144.jpg} As you should be aware by now, one of the verdicts you can get when submitting a solution to a problem is \textbf{Time Limit Exceeded} (\textbf{TLE}). This means that the running time of your solution exceeds the time limit set by judges. Let us assume that the judging server can make \textbf{100000000} operations per second. Given the time complexity of your solution expressed using \textbf{big-O }notation, maximum size of the input per test case \textbf{N}, the number of test cases \textbf{T} and the time limit for all cases \textbf{L }can your solution run in time? Assume that your solution uses only simple operations and disregard any other overhead (e.g. I/O). \InputFile Input starts with a line containing an integer \textbf{C} (\textbf{1} ≤ \textbf{C} ≤ \textbf{100}), the number of test cases. \textbf{C} lines follow, each of the format \textbf{N T L} where \textbf{N}, \textbf{T} and \textbf{L} are integers as described in the problem statement (\textbf{1} ≤ \textbf{N} ≤ \textbf{1000000}, \textbf{1} ≤ \textbf{T}, \textbf{L} ≤ 10). and is one of the following: \textbf{O(N), O(N^2), O(N^3), O(2^N), O(N!)} Note: We use a very simplified complexity model here and familiarity with \textbf{big-O} notation is not required (or may even be detrimental). Just assume that applying N to the function in the parenthesis is what gives you the total number of operations your solution will use. \OutputFile For each test case print on one line either "\textbf{TLE!}" if the running time of the solution exceeds the time limit for that test case or "\textbf{May Pass.}" if it does not.