C. Doors Breaking and Repairingtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are policeman and you are playing a game with Slavik. The game is turn-based and each turn consists of two phases. During the first phase you make your move and during the second phase Slavik makes his move.There are n doors, the i-th door initially has durability equal to a_i.During your move you can try to break one of the doors. If you choose door i and its current durability is b_i then you reduce its durability to max(0, b_i - x) (the value x is given).During Slavik's move he tries to repair one of the doors. If he chooses door i and its current durability is b_i then he increases its durability to b_i + y (the value y is given). Slavik cannot repair doors with current durability equal to 0.The game lasts 10^{100} turns. If some player cannot make his move then he has to skip it.Your goal is to maximize the number of doors with durability equal to 0 at the end of the game. You can assume that Slavik wants to minimize the number of such doors. What is the number of such doors in the end if you both play optimally?InputThe first line of the input contains three integers n, x and y (1 \le n \le 100, 1 \le x, y \le 10^5) — the number of doors, value x and value y, respectively.The second line of the input contains n integers a_1, a_2, \dots, a_n (1 \le a_i \le 10^5), where a_i is the initial durability of the i-th door.OutputPrint one integer — the number of doors with durability equal to 0 at the end of the game, if you and Slavik both play optimally.ExamplesInput
6 3 2
2 3 1 3 4 2
Output
6
Input
5 3 3
1 2 4 2 3
Output
2
Input
5 5 6
1 2 6 10 3
Output
2
NoteClarifications about the optimal strategy will be ignored.
6 3 2
2 3 1 3 4 2

6 
['games', '*1200']