Naohiro has a monster. The monster's current health is H.

He also has N kinds of potions, numbered from 1 to N in ascending order of effectiveness.

If you give the monster potion n, its health will increase by Pn. Here, P1<P2<⋯<P N.

He wants to increase the monster's health to X or above by giving it one of the potions.

Print the number of the least effective potion that can achieve the purpose. (The constraints guarantee that such a potion exists.)

给定一个升序的数组 P，求满足 P_i+h\ge x 的 P_i 中最小的编号。

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

N H X

P1 P2 P3....PN

Print the number of the least effective potion that can achieve the purpose.

2≤N≤100

1≤H<X≤999

1≤P1<P2<⋯<PN=999

All input values are integers.