A scheduler processes jobs on a 4x4 grid from $(0,0)$ to $(4,4)$. To maintain stability, the number of 'Up' moves must never strictly exceed the number of 'Right' moves at any point (the path must stay on or below the diagonal $y=x$). How many valid scheduling paths exist?