Chef and Notebooks

Problem Statement 

The link to problem is here.  

Chef likes to write poetry. Today, he has decided to write a X pages long poetry, but unfortunately his notebook has only Y pages left in it. Thus he decided to buy a new CHEFMATE notebook and went to the stationary shop. Shopkeeper showed him some N notebooks, where the number of pages and price of the i^th one are P_i pages and C_i rubles respectively. Chef has spent some money preparing for Ksen's birthday, and then he has only K rubles left for now.

Chef wants to buy a single notebook such that the price of the notebook should not exceed his budget and he is able to complete his poetry.

Help Chef accomplishing this task. You just need to tell him whether he can buy such a notebook or not. Note that Chef can use all of the Y pages in the current notebook, and Chef can buy only one notebook because Chef doesn't want to use many notebooks.

Input

The first line of input contains an integer T, denoting the number of test cases. Then T test cases are follow.

The first line of each test case contains four space-separated integers X, Y, K and N, described in the statement. The i^th line of the next N lines contains two space-separated integers P_i and C_i, denoting the number of pages and price of the i^th notebook respectively.

Output

For each test case, Print "LuckyChef" if Chef can select such a notebook, otherwise print "UnluckyChef" (quotes for clarity).

Constraints and Subtasks

• 1 ≤ T ≤ 10⁵
• 1 ≤ Y < X ≤ 10³
• 1 ≤ K ≤ 10³
• 1 ≤ N ≤ 10⁵
• 1 ≤ P_i, C_i ≤ 10³

Subtask 1: 40 points

• Sum of N over all test cases in one test file does not exceed 10⁴.

Subtask 2: 60 points

• Sum of N over all test cases in one test file does not exceed 10⁶.

Sample

Input
3
3 1 2 2
3 4
2 2    
3 1 2 2
2 3
2 3    
3 1 2 2
1 1
1 2

Output
LuckyChef
UnluckyChef
UnluckyChef

Explanation

Example case 1. In this case, Chef wants to write X = 3 pages long poetry, but his notebook has only Y = 1 page. And his budget is K = 2 rubles, and there are N = 2 notebooks in the shop. The first notebook has P₁ = 3 pages, but Chef cannot buy it, because its price is C₁ = 4 rubles. The second notebook has P₂ = 2 pages, and its price is C₂ = 2 rubles. Thus Chef can select the second notebook to accomplish the task. He will write 1 page of poetry in the old notebook, and 2 page of poetry in the new notebook.

Example case 2. Chef cannot buy any notebook, because the prices exceed the Chef's budget.

Example case 3. No notebook contains sufficient number of pages required to write poetry.

Problem Solving

• The Chef's requirement Req= X - Y, no of pages required 
• Since X > Y is given no need to check this condition
•  The Solution is that out of all (P,C) if there exists a (P,C) such that P >= Req && C <=K then the chef can work else not, 
• Note we should not worry about finding the optimal solution since the objective is only to find one solution but not the best one. 
• Looking at limits of the inputs unsigned int is sufficient  
• The submission is successful, here

Learning

• This problem was not any different from the previous one. 
• The only smart thing to do was to reduce the comparison operation by using a bool once the answer was found. 
• Let's see if the next problem would be any different.