Given integers $m, n \geqslant 2$. Color each cell of an $m$-row by $n$-column grid $S$ with either red or blue such that the following condition is satisfied: For any two cells in the same row, if both are colored red, then one column must have all cells colored red, and the other column must have at least one cell colored blue. Find the number of different coloring methods. Please provide the value when $m = 2$ and $n = 3$. 

Let's think step by step and output the final answer within \boxed{}.
user