Title Description

$\text{Farmer John}$ suffered a terrible loss when giant Australian cockroaches ate the entirety of his hay inventory, leaving him with nothing to feed the cows. He hitched up his wagon with capacity $C$ cubic units and sauntered over to Farmer Don's to get some hay before the cows miss a meal.

$\text{Farmer Don}$ had a wide variety of $H$ hay bales for sale, each with its own volume $V_i$. Bales of hay, you know, are somewhat flexible and can be jammed into the oddest of spaces in a wagon.

$\text{FJ}$ carefully evaluates the volumes so that he can figure out the largest amount of hay he can purchase for his cows.

Given the volume constraint and a list of bales to buy, what is the greatest volume of hay $\text{FJ}$ can purchase? He can't purchase partial bales, of course. Each input line (after the first) lists a single bale $\text{FJ}$ can buy.

Input format

On the $1$ line, enter $C$ and $H$, and then on the $H$ line, enter $V_i$.

Output format

The maximum volume of hay that can be purchased.

Samples

7 3 //The total volume is 7, and 3 items are used to pack the backpack
2
6
5

7 //The maximum volume that can be memorized

Example explanation

The wagon holds $7$ volumetric units; three bales are offered for sale with volumes of $2, 6$, and $5$ units, respectively.

Buying the two smaller bales fills the wagon.

Data scope and agreement

For $100\%$ of the data:$1≤C≤50000,1≤H≤5000,1≤Vi≤C$.