Professor Edson used the University Week to organize a game night with the members of UnBalloon. Since everyone is a competitive programmer, impartial combinatorial games were chosen!

The game in question is played on a grid of cells with $$$N$$$ rows and $$$M$$$ columns (each of the $$$N$$$ rows of the grid has $$$M$$$ cells). Initially, all cells are empty.

Wilson and Pedro are the next pair to play this game, which is played in turns. Wilson starts by playing, and on his turn, he must choose an empty cell and write the letter $$$W$$$ in it (so that it is no longer empty). Pedro must do the same on his turn, but writing the letter $$$P$$$. The player who cannot make a move (when all cells are marked) loses.

Both have devised quite elaborate strategies to outsmart their opponent. Unfortunately, you will not be able to follow the game to the end, but you know that no matter how hard one of the players tries, victory will certainly belong to the other. Which player will be the winner?