becoder Evaluation Challenge

becoder has the fastest judging machine among all Chinese OJs. It processes n evaluations. The i-th evaluation ran in T_i seconds and used M_i space on a Chinese OJ. However, becoder judges the i-th evaluation in $$\left\lfloor \frac{T_i}{2} \right\rfloor$$ seconds.

You are given the time limits t_i and memory limits m_i for these evaluations on becoder. Additionally, during the evaluations in the interval [L, R], the judging machine falls asleep.

The judging rules are as follows:

• If the judge is asleep (i.e. the evaluation index i is in [L, R]), it returns System Error.
• If the judge is not asleep and your code exceeds the memory limit (i.e. M_i > m_i), it returns Memory Limit Exceeded.
• If the machine is not asleep and the memory is within limit but the execution time is exceeded (i.e. M_i ≤ m_i and $$\left\lfloor \frac{T_i}{2} \right\rfloor > t_i$$), it returns Time Limit Exceeded.
• Otherwise, it returns Accepted.

Please output the judging result for each evaluation.

inputFormat

The first line contains three integers n, L, and R, where n is the number of evaluations. Each of the next n lines contains four space-separated integers: T_i, M_i, t_i, and m_i.

outputFormat

Output n lines. Each line should contain one of the strings: System Error, Memory Limit Exceeded, Time Limit Exceeded, or Accepted, corresponding to the result of each evaluation.

sample

5 2 3
4 10 1 20
6 20 3 15
8 30 4 25
10 50 6 50
9 100 5 80

Time Limit Exceeded
System Error
System Error
Accepted
Memory Limit Exceeded