K-nim#5878
The Code Must Be Respected!
I. Ilf, E. Petrov
Ostap enjoys playing games with his friends, but he always gets in trouble for secretly taking stones from more than one pile at a time. Tired of this, he invented his own game where, from now on, it is allowed to take stones from one, two, ..., up to piles simultaneously. The number of piles used in a move can be any number from to , and from each chosen pile, any (possibly different) number of stones may be taken.
"Now my friends won't accuse me of cheating when I introduce them to this new game! Yes, that's it! I'll call this game K-nim" Ostap thought, "But I don't know the rules well enough to play optimally! I need to write a program that will suggest the best move... But I don't know how to program either... I'll have to promise half of my future winnings to whoever writes it for me."
The first line contains two natural numbers: and (N, K \leq 10^5) — the number of piles and the maximum number of piles from which stones can be taken in one move. The second line contains natural numbers, each not exceeding 10^9 — the sizes of the piles.
If Ostap has a winning move, output in the first line the number of piles from which he should take stones. In the second line, output the states of all piles after Ostap's move, in the original order, with numbers separated by spaces. If Ostap cannot win, output the single number .
Example 1