An m $ imes$ n grid contains a ball initially located at coordinate (startRow, startColumn). In each step, you can move the ball to one of the four adjacent cells: up, down, left, or right. A move can also take the ball past the edge of the grid.

Given the integers m, n, maxMove, startRow, and startColumn, return the number of distinct paths to move the ball off the boundary of the grid using at most maxMove moves. Since the answer can be very large, return it modulo $10^9 + 7$.

Constraints:

• $1 \leq$ m, n $\leq 50$

• $0 \leq$ maxMove $\leq 50$

• $0 \leq$ startRow $<$ m

• $0 \leq$ startColumn $<$ n

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.