Problem #PRU-30439

Problem

Consider a chessboard of size (number of rows $\times$ number of columns): a) $9\times 10$; b) $10\times 12$; c) $9\times 11$. Two people are playing a game where: in one turn a player is allowed to cross out any row or column as long as there it contains at least one square that is not crossed out. The loser is the player who cannot make a move. Which player will win?