Given a list of Nim positions, print the best move for each one.

Nim is a 2-player turn based game. The game consists of several piles which each have some number of objects in them. On your turn, you choose a pile and remove any amount from that pile (at least one). The player who takes the last object wins (i.e. leaves the opponent with no available moves).

Given two piles of size 2 and size 1:

    2  1

You have 3 possible moves:

Here the best move is to take one from the left pile.

All inputs have exactly one best move and each pile has at most 5 objects.

Output is of the form "x y", where x is the index of the pile to take from and y is the amount to take, with each output move on their own line.

External links: Wikipedia