Diet Plan

You have a diet plan for the next $N$ days (numbered from $1$ to $N$). During day $i$, you need to drink exactly $P_i$ mL of milk. Alternatively, you can consume a biscuit instead, as a replacement for milk on that day.

Currently, you only have $M$ mL of milk and $K$ biscuits. If there is not enough milk to drink on a day and you run out of biscuits, then your diet plan stops.

Determine the maximum number of days you can maintain your diet plan.

The first line consists of three integers $N$ $M$ $K$ ($1 ≤ N ≤ 100$; $0 ≤ M, K ≤ 100$).

The next line consists of $N$ integers $P_i$ ($1 ≤ P_i ≤ 100$).

Output a single integer representing the maximum number of days you can maintain your diet plan.