eolymp
bolt
Попробуйте наш новый интерфейс для отправки задач
Задачи

Time Limit Exceeded

Time Limit Exceeded

Лимит времени 1 секунда
Лимит использования памяти 64 MiB

As you should be aware by now, one of the verdicts you can get when submitting a solution to a problem is Time Limit Exceeded (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 100000000 operations per second. Given the time complexity of your solution expressed using big-O notation, maximum size of the input per test case n, the number of test cases t and the time limit for all cases l can your solution run in time?

Assume that your solution uses only simple operations and disregard any other overhead (e.g. I/O).

Входные данные

Input starts with a line containing the number of test cases c(1 c 100). c lines follow, each of the format

time_complexity n t l

where n, t and l (1 n 1000000, 1t, l10) are integers as described in the problem statement. and time_complexity is one of the following:

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 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.

Выходные данные

For each test case print on one line either "TLE!" if the running time of the solution exceeds the time limit for that test case or "May Pass." if it does not.

Пример

Входные данные #1
5
O(N) 1000 10 10
O(2^N) 1000 10 10
O(N!) 2 10 10
O(N^3) 1000 1 10
O(N^3) 1001 1 10
Выходные данные #1
May Pass.
TLE!
May Pass.
May Pass.
TLE!
Автор Hichem Zakaria Aichour
Источник 2013 Calgary Collegiate Programming Contest, Problem A