Count Monotone Grid Paths Through Ordered Checkpoints

Given an n × m grid with rows 0..n-1 and columns 0..m-1, Alice starts at (n-1, 0) and must reach (n-1, m-1).

Every move advances exactly one column and can be up-right, right, or down-right...