The best of the worst vs. the worst of the best#2342
In the computer game latroM tabmoK, two players participate. Each player selects one of the available fighter characters. After selection, these characters, controlled by the players, enter the battle arena and fight each other. Zhenya and Sasha have been playing the game for a long time and know the strength of each fighter. Thus, they can easily predict the outcome of any battle, except for a mirror match (when both players choose the same character).
When they play together, they agree on the following character selection process. First, Zhenya names different fighters. Sasha then chooses one of these for Zhenya to play. Naturally, Zhenya will try to select the strongest fighters, while Sasha will pick the weakest among them. Next, Zhenya names different fighters, from which Sasha chooses one for himself. In this situation, it is beneficial for Zhenya to select the weakest fighters, while Sasha picks the strongest among them. The two chosen fighters then battle.
Write a program to determine the winner of this battle.
The first line contains an integer — the number of fighter characters in the game (1 \leq N \leq 10^5).
The second line contains integers, each representing the strength of a character. All these numbers are distinct and range from to 10^9.
The third line contains two integers and — the number of characters Zhenya selects for himself and for Sasha, respectively (1 \leq K, L \leq N).
Print one symbol:
"" if Zhenya's character (the weakest of the strongest) wins the battle.
"" if Sasha's character (the strongest of the weakest) wins the battle.
"" if the outcome of the battle cannot be predicted.
Example 1