There are only $O$ s on the board.

Logic Level 3

$\begin{array}{|l|c|r|}\hline O & O & O \\ \hline O & O & O \\ \hline O& O & O \\ \hline \end{array}$

There are 9 $O$ s on the board.
Two players take turns to play.
Each player needs to choose a row or column(no diagonals) and take away 1 to 3 of the $O$ s in that row or column.
The player who takes away the last $O$ on the board wins.

Assume that the two players play optimally,then who will definitely win?

There are only OOOs on the board.