Score : $200$ points

问题陈述

有 $N$ 个人，第 $i$ 个人当前的头发长度为 $L_i$（$1 \leq i \leq N$）。 每个人每天头发长度增加 $1$。

打印出头发长度至少为 $T$ 的人数首次达到 $P$ 或更多时的天数。 如果现在头发长度至少为 $T$ 的人数已经达到 $P$ 或更多，则打印 $0$。

以上为大语言模型 kimi 翻译，仅供参考。

Problem Statement

There are $N$ people, and the current hair length of the $i$-th person $(1 \leq i \leq N)$ is $L_i$.
Each person's hair grows by $1$ per day.

Print the number of days after which the number of people whose hair length is at least $T$ becomes $P$ or more for the first time.
If there are already $P$ or more people whose hair length is at least $T$ now, print $0$.

Constraints

• $1 \leq N \leq 100$
• $1 \leq L_i \leq 100$
• $1 \leq T \leq 100$
• $1 \leq P \leq N$
• All input values are integers.

Input

The input is given from Standard Input in the following format:

$N$ $T$ $P$

$L_1$ $L_2$ $\ldots$ $L_N$

Output

Print the number of days after which the number of people whose hair length is at least $T$ becomes $P$ or more for the first time. If this condition is already satisfied now, print $0$.

Sample Input 1

5 10 3
3 11 1 6 2

Sample Output 1

7

There are five people, and their current hair lengths are $3, 11, 1, 6, 2$, so there is one person whose hair length is at least $10$.

After seven days, the hair lengths of the people will be $10, 18, 8, 13, 9$, respectively, and there will be three people whose hair length is at least $10$.
After six days, there are only two people whose hair length is at least $10$, not satisfying the condition, so print $7$.

Sample Input 2

2 5 2
10 10

Sample Output 2

0

Since there are already two people whose hair length is at least $5$ now, satisfying the condition, so print $0$.

Sample Input 3

3 10 1
1 2 3

Sample Output 3

7