Matrix

dp[i][j] = paths from above + paths from the left; edges are all 1.

Use the first row and first column as your zero-marker notepad so you need only constant extra memory.

Ways to a cell equal ways from above plus ways from the left.

Make it a ring, reduce k by length, cut at length - k % length, and the node after the cut is the new head.