The best of the worst vs. the worst of the best
In the computer game latroM tabmoK, two players can participate. Each player can select one of the N available fighter characters in the game. Once chosen, these characters enter the battle arena to compete against each other, controlled by the players. Zhenya and Sasha have been playing this game for a long time and are familiar with the strength of each fighter. As a result, they can easily predict the outcome of any match, except for a mirror match (when both players choose the same character).
When they gather to play their favorite game, they agree on the following character selection process: First, Zhenya names K different fighter characters. Sasha will then choose one of these for Zhenya to play. Naturally, Zhenya will try to select the strongest characters, while Sasha will pick the weakest among them. Next, Zhenya will name L different characters, from which Sasha will choose one for himself. In this scenario, it benefits Zhenya to select the weakest characters, and Sasha will choose the strongest among them. The two characters chosen in this manner will then battle.
Write a program to determine the winner of this battle.
Input
The first line contains an integer N - the number of fighter characters in the game (1 ≤ N ≤ 10^5). The second line contains N integers, each representing the strength of a corresponding character. All these numbers are distinct and range from 0 to 10^9. The third line contains two integers K and L - the number of characters Zhenya selects for himself and for Sasha, respectively (1 ≤ K, L ≤ N).
Output
Output one of the following symbols: ">", if Zhenya's character (the weakest of the strongest) wins the battle; "<", if Sasha's character (the strongest of the weakest) wins; and "=", if the outcome of the battle cannot be predicted.