Who can help with the game of Nim: basicly players alternate removing matches from several piles. At each turn a player

may remove any number of matches from a single pile. The player unable to move is the loser.

For example assume 3 piles with 1,2 and 5 matches. First player takes 3 from the last pile leaving (1,2,2),

the second player takes 2 from the middle pile leaving (1,0,2), the first player take 2 from the last pile leaving

(1,0,0), and the second player wins by taking the last match from the first pile.

Assume there are two piles left in the game with three and one (3,1) matches. Draw the full game graph. What

is the winning move, if any, from this position?