Suppose 2 people are playing a game. They have two strings of nucleotides, one of length n and the other of length m. At every turn, a person must delete 2 nucleotides from 1 string (either the 1st or the 2nd) and 1 nucleotide from the other. The person who cannot move loses the game. Who wins the game? What's the winning strategy for each n and m?