Buy Water Balloons

As Holi is coming, Karan wants to buy some water balloons to prepare for it. He visits a shopkeeper who has N different types of balloons. Each type of balloon has a price denoted by array A. 

The shopkeeper has an offer where Karan can buy at most B balloons at the price of one. The price of these B or less balloons would be equal to the price of the maximum-priced balloon. Karan wants to buy only one balloon of each type. He has an amount equal to C, so he can’t spend more amount than C. What is the maximum number of balloons he can buy?

1 <= |A| <= 10⁵

1 <= A[i] <= 10⁴

1 <= B <= |A|

1 <= C <= 10⁹

The first argument is an integer array A.
The second argument is an integer B.
The third argument is an integer C.

Return an integer, the answer to the problem.

Input 1:

A = [2, 4, 5, 3, 7]
B = 2
C = 6

Input 2:

A = [1]
B = 1
C = 1

Output 1:

3

Output 2:

1

For Input 1:

First, Karan can buy type 2 and type 4 at the price of 4 as type 2 has the maximum price. Then he buys the type 1 alone at the price of 2. He spends a total amount of 6 buying 3 balloons.

For Input 2:

He buys type 1 at price 1.