For the variant of tic-tac-toe played on an $m\times n$ board, where you win if you completely fill any row or column with your mark (no diagonal wins), how many possibilities are there for the final board of a drawn game?
Example for $m=n=3$:
| X | O | O |
| O | X | X |
| X | O | O |