Description
And now my watch begins.
~by a binge watching man
Your a lord commander of the night's watch. You wants to choose some men to be your soldiers while other lords also needs to choose some men. There're n lords and n soldiers and there're k lords who are your friends therefore they will follow your order. And each soldier's ability is represented by a number ai. Since the lords stand in a line and wait for their turn to choose, you are standing in the m-th position.
Given a sequence of numbers a1 ~ an. n people standing in a line to choose one number from the sequence.
Each person can only choose a number from the head or the tail of the sequence.
Once a number is chosen, it will be remove from the sequence.
You are at m-th position of the line.
You want to get the number as big as possible.
You can command at most k people to choose what you want them to choose(head or tail).
But you can not change your command during the choosing process.
And those who you don't give a command will choose arbitrarily.
Your task is to find out what is the greatest integer x such that, no matter what are the choices of the others you didn't choose to control, the element you will take from the array will be at least x?
Example:
If there are n=6 numbers 2, 9, 2, 3, 8, 5.
You are at m=4 position.
And you can control k=2 people.
If the first person ordered by you choose tail 5.
The second person ordered by you choose head 2.
Then the third person can choose either 9 or 8.
No matter what the third person choose, you can get at least 8.
Therefore the answer is 8.
Input
The first line of input will be t(1 <= t <= 10) means number of testcases.
Each testcases contains two lines.
First line contains three integers n( 1 <= n <= 5000), m(1 <= m <= n), k(0 <= k <= n-1).
Second line contains n integers ai(1 <= ai <= 10^9).
Output
For each testcases, print a single integer x.
Each output is ended by \n.