So it's clear that the total number of shortest routes in a lattice path given a $mxn$ grid is $\binom{s}{r}$ where $s$ is the total number of steps, and $r$ is the total number of right steps. But this is simply to easy. So consider instead this question.
Given a shortest path $p$, how does this determine some $r$-element subset of an $s$-element set $A_p$?
Note: Edited for clarification.