Justice#2854
Let's play a game. There are several heaps, each containing a certain number of stones. In one move, you can take any number of stones from one of the heaps, even all of them. The player who cannot make a move loses.
Alright, but I go first.
Okay, then I choose how many stones we have.
Fine, then I choose how many heaps there will be.
Then I will distribute the stones into heaps.
Good luck.
Two numbers and (1 \leq N \leq 10^9, 2 \leq K \leq 16) — the number of stones and the number of heaps.
If it is impossible to split stones into non-empty heaps such that, with optimal play from both players, the second player will win, output . Otherwise, output positive integers a_i — the sizes of the heaps.
Esempio 1