With rectangular axes of coordinates, the number of paths from $(1,1)$ to $(8,10)$ via $(4,6)$, where each step from any point $(x,y)$ is either to $(x,y+1)$ or to $(x+1,y)$ is