3878: Optimal Coin Change

In a 10-dollar shop, everything is 10 dollar or less. In order to serve customers more effectively at the cashier, change needs to be provided in a minimum number of coins.
 In this problem, you are going to provide a given value of the change in different coins. Write a program to calculate the number of coins needed for each type of coin.
 The input includes a value v, a size of the coinage set n, and a face value of each coin, f1,f2,···,fn. The output is a list of numbers, namely, c1,···,cn, indicating the number of coins needed for each type of coin. There may be many ways for the change. The value v is an integer satisfying 0 < v ≤ 2000, representing the change required in cents. The face value of a coin is less than or equal to 10000. The output of your program should take the combination with the least number of coins needed.
 For example, the Hong Kong coinage issued by the Hong Kong Monetary Authority consists of 10 cents, 20 cents, 50 cents, 1 dollar, 2 dollars, 5 dollars and 10 dollars would be represented in the input by n = 7, f1 = 10, f2 = 20, f3 = 50, f4 = 100, f5 = 200, f6 = 500, f7 = 1000. 

The test data may contain many test cases, please process it to the end of the file. 
Each test case contains integers v,n,f1,···,fn in a line. It is guaranteed that n ≤ 10 and f1 < f2 < ··· < fn. 

The output be n numbers in a line, separated by space. If there is no possible change, your output should be a single −1. If there are more than one possible solutions, your program should output the one that uses more coins of a lower face value. 

2000 7 10 20 50 100 200 500 1000 
250 4 10 20 125 150
35 4 10 20 125 150 
48 4 1 8 16 20 
40 4 1 10 13 37 
43 5 1 2 21 40 80

0 0 0 0 0 0 2
0 0 2 0 
-1 
0 1 0 2 
3 0 0 1 
1 1 0 1 0