CF808C Tea Party

Polycarp invited all his friends to the tea party to celebrate the holiday. He has $ n $ cups, one for each of his $ n $ friends, with volumes $ a_{1},a_{2},...,a_{n} $ . His teapot stores $ w $ milliliters of tea ( $ w

The first line contains two integer numbers $ n $ and $ w $ ( $ 1

Output how many milliliters of tea every cup should contain. If there are multiple answers, print any of them. If it's impossible to pour all the tea and satisfy all conditions then output -1.

In the third example you should pour to the first cup at least 5 milliliters, to the second one at least 4, to the third one at least 5. It sums up to 14, which is greater than 10 milliliters available.