CF1102C.Doors Breaking and Repairing

You 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?

你是一名警察，正在与斯拉维克进行一场游戏。游戏采用回合制，每个回合包含两个阶段：第一阶段由你行动，第二阶段由斯拉维克行动。

共有 $n$ 扇门，第 $i$ 扇门的初始耐久度为 $a_i$。

在你的行动阶段，你可以尝试破坏其中一扇门。若你选择第 $i$ 扇门，且其当前耐久度为 $b_i$，则其耐久度将变为 $\max(0, b_i - x)$（其中 $x$ 是给定值）。

在斯拉维克的行动阶段，他会尝试修复其中一扇门。若他选择第 $i$ 扇门，且其当前耐久度为 $b_i$，则其耐久度将变为 $b_i + y$（其中 $y$ 是给定值）。斯拉维克无法修复当前耐久度为 $0$ 的门。

游戏共进行 $10^{100}$ 回合。若某位玩家无法执行其行动，则必须跳过该回合。

你的目标是最大化游戏结束时耐久度恰好为 $0$ 的门的数量。假设斯拉维克的目标是最小化此类门的数量。若双方均采取最优策略，游戏结束时耐久度为 $0$ 的门的数量是多少？

The 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.

输入的第一行包含三个整数 $n$、$x$ 和 $y$（$1 \le n \le 100$，$1 \le x, y \le 10^5$），分别表示门的数量、数值 $x$ 和数值 $y$。

输入的第二行包含 $n$ 个整数 $a_1, a_2, \dots, a_n$（$1 \le a_i \le 10^5$），其中 $a_i$ 表示第 $i$ 扇门的初始耐久度。

Print one integer — the number of doors with durability equal to $0$ at the end of the game, if you and Slavik both play optimally.

输出一个整数——如果双方都采取最优策略，游戏结束时耐久度为 $0$ 的门的数量。

Clarifications about the optimal strategy will be ignored.

关于最优策略的澄清将被忽略。