A boy named Poltu is very fond of food. He eats a lot and you can tell so by looking at him.
There are many restaurants in his locality. You can assume the locations are on the x-axis. Let's say the number of restaurants is n. And in a day he wants to eat food from exactly k restaurants.
But since he is fat, he doesn't want to walk more than p distance on the x-axis.
He only wants to start from any non-negative integer point and go in any one direction only. Can you help him determine if he can eat the food he wants?
Input
In the first line of input there is T (1 ≤ T ≤ 50), the number of test cases.
Each test case starts with a line with three integers n (1 ≤ n ≤ 5x105), k (1 ≤ k ≤ n), p (0 ≤ p ≤ 109) as described in the statement.
In the next line, there are n integers a1, a2, a3,... ,an (|ai| ≤ 108), the i-th integer describes the location of the i-th restaurant.
Output
If it is not possible to eat without walking more than p distance print "Get Slimmer. :/" (w/o quotes).
Otherwise, print the two integers: the smallest distance he has to walk and which point to start from.
If there are many points he can start print the leftmost one.
Sample
| Input | Output |
|---|---|
2 7 2 5 2 5 23 27 45 48 1000000 2 2 2 3 7 | Case 1: 3 2 Case 2: Get Slimmer. :/ |
