3596. Minimum Cost Path with Alternating Directions I

There are only three grid sizes for which reaching (m - 1, n - 1) is possible under the move rules: m = 1, n = 1; m = 1, n = 2; m = 2, n = 1.