OpenKattis
Kattis Set 07

#### Start

2020-03-02 04:15 AKST

## Kattis Set 07

#### End

2020-03-09 01:30 AKDT
The end is near!
Contest is over.
Not yet started.
Contest is starting in -604 days 7:32:12

164:15:00

0:00:00

# Problem DFair Division

It’s your friend’s birthday, and you and some other people decided to buy him a copy of StarCraft II, because who wouldn’t want to have that?

You agreed to divide the costs as fairly as possible. Since some of you have more money available than others, you also agreed that nobody has to pay more than he can afford. Every contribution will be a multiple of 1 cent, and nobody can pay fractions of a cent.

Everybody writes down the maximum amount he is able to contribute. Taking into account these maximum amounts from everybody, you share the cost of the present as fairly as possible. That means, you minimize the largest distance of the contributions to $\frac{1}{n}$-th of the total cost. In case of a tie, minimize the second largest distance and so on. Since the smallest unit of contribution is 1 cent, there might be more than one possible division of the cost. In that case, persons with a higher maximum amount pay more. If there is still ambiguity, those who come first in the list pay more.

Since you bought the present, it is your task to figure out how much everybody has to pay (including you).

## Input

On the first line a positive integer: the number of test cases, at most 100. After that per test case:

• One line with two integers $p$ and $n$: the price of the present in cents $(1 \le p \le 1\, 000\, 000)$ and the number of people $(2\le n\le 100)$ who contribute to the present (including you).

• One line with $n$ integers $a_ i$ $(1 \le a_ i \le 1\, 000\, 000)$, where $a_ i$ is the maximum amount, in cents, that the $i$-th person on the list is able to contribute.

## Output

Per test case:

• One line with $n$ integers: the amounts each person has to contribute according to the scheme, or “IMPOSSIBLE” if the amount cannot be shared.

Sample Input 1 Sample Output 1
3
20 4
10 10 4 4
7 3
1 1 4
34 5
9 8 9 9 4

6 6 4 4
IMPOSSIBLE
8 7 8 7 4