# Problem D

Who Goes There?

What happens when more teams want to go to an ICPC regional site than the site has capacity for? Who goes there?

One possible policy is the following: Every school is allowed to register as many teams as they wish. Accept every school’s first team, then accept every school’s second team (for schools with more than one team), then third, and so on, until all teams are accepted, or there isn’t enough capacity for the next wave. Then, if there are extra spots available, the spots are given to schools, one by one, in the order that the schools registered.

Given the capacity of a site, the number of teams registered by each school and the order that they registered, determine how many teams from each school are accepted.

## Input

The first line of input contains two integers $n$ ($1 \le n \le 100$) and $m$ ($1 \le m \le 100$), where $n$ is the capacity of the site and $m$ is the number of schools that wish to compete there.

Each of the next $m$ lines contains an integer $t$ ($1 \le t \le 100$), which is the number of teams that a school has registered. The schools are listed in the order that they registered.

## Output

Output $m$ lines, one for each school. Each line must contain a single integer indicating the number of teams accepted from that school. Output them in the same order as they appear in the input.

Sample Input 1 | Sample Output 1 |
---|---|

20 5 7 5 1 6 12 |
5 5 1 5 4 |