each route must have total m+n steps

and each route must have exactly m steps turn right and n step upward,

so # of route is same as how many ways u can select these m steps(right) or n steps(up) from total steps(m+n).

that's C(m+n, m)=C(m+n,n).