ATM#4813
In some country in circulation there are notes of certain denominations. National Bank wants the cash machine to give out any requested amount with a minimum number of banknotes, considering that the amount of banknotes of each denomination is unlimited.
Help the National Bank to solve this problem.
First line contains the number of banknotes denominations in circulation (n \leq 100). Second line contains different positive integers x_1, x_2, ..., x_n not greater than 10^6 - the banknotes denominations. Third line contains the sum (s \leq 10^6) that you want to give.
Print in the first line the minimal number of summands (or if such representation does not exist). In the second line print these summands in any order.
Example 1