<p>There is an <code>m x n</code> grid with a ball. The ball is initially at the position <code>[startRow, startColumn]</code>. You are allowed to move the ball to one of the four adjacent cells in the grid (possibly out of the grid crossing the grid boundary). You can apply <strong>at most</strong> <code>maxMove</code> moves to the ball.</p>

<p>Given the five integers <code>m</code>, <code>n</code>, <code>maxMove</code>, <code>startRow</code>, <code>startColumn</code>, return the number of paths to move the ball out of the grid boundary. Since the answer can be very large, return it <strong>modulo</strong> <code>10<sup>9</sup> + 7</code>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/28/out_of_boundary_paths_1.png" style="width: 500px; height: 296px;" />
<pre>
<strong>Input:</strong> m = 2, n = 2, maxMove = 2, startRow = 0, startColumn = 0
<strong>Output:</strong> 6
</pre>

<p><strong class="example">Example 2:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/28/out_of_boundary_paths_2.png" style="width: 500px; height: 293px;" />
<pre>
<strong>Input:</strong> m = 1, n = 3, maxMove = 3, startRow = 0, startColumn = 1
<strong>Output:</strong> 12
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= m, n &lt;= 50</code></li>
	<li><code>0 &lt;= maxMove &lt;= 50</code></li>
	<li><code>0 &lt;= startRow &lt; m</code></li>
	<li><code>0 &lt;= startColumn &lt; n</code></li>
</ul>

class Solution {
public:
    int solve(int m,int n,int row,int col,int move,vector<vector<vector<int>>>&dp){
        if(move < 0){
            return 0;
        }

        if(row < 0 || col < 0 || col >= n || row >= m){
            return 1;
        }

        if(dp[row][col][move] != -1){
            return dp[row][col][move];
        }

        int ans1 = solve(m,n,row+1,col,move-1,dp)%static_cast<int>(1e9+7);
        int ans2 = solve(m,n,row-1,col,move-1,dp)%static_cast<int>(1e9+7);
        int ans3 = solve(m,n,row,col+1,move-1,dp)%static_cast<int>(1e9+7);
        int ans4 = solve(m,n,row,col-1,move-1,dp)%static_cast<int>(1e9+7);

        dp[row][col][move] = ((ans1 + ans2)%static_cast<int>(1e9+7) + (ans3 + ans4)%static_cast<int>(1e9+7))%static_cast<int>(1e9+7);

        return dp[row][col][move];
    }

    int findPaths(int m, int n, int maxMove, int startRow, int startColumn) {
        vector<vector<vector<int>>>dp(m,vector<vector<int>>(n,vector<int>(maxMove+1,-1)));
        return solve(m,n,startRow,startColumn,maxMove,dp)%static_cast<int>(1e9+7);
    }
};
10703