CH-SMO 2021 Problem 1

Let $(m,n)$ be pair of positive integers. Julia has carefully planted $m$ rows of $n$ dandelions in an $m \times n$ array in her back garden. Now, Jana un Viviane decides to play a game with a lawnmower they just found. Taking alternating turns and starting with Jana, they can now mow down all the dandelions in a straight horizontal or vertical line (and they must mow down at least one dandelion ). The winner is the player who mows down the final dandelion. Determine all pairs of $(m,n)$ for which Jana has a winning strategy.