You are given an m $ imes$ n matrix grid. You start at cell $(0, 0)$ and want to reach cell $(m - 1, n - 1)$ by moving only right or down at any step.

The product of a path is the result of multiplying the values of all cells traversed along the path.

Return the maximum non negative product of a path from $(0, 0)$ to $(m - 1, n - 1)$ modulo $10^9 + 7$. If the maximum product is negative, return $-1$.

Note: The modulo operation is applied after determining the maximum product.

Constraints:

• m $==$ grid.length

• n $==$ grid[i].length

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

• $-4 \leq$ grid[i][j] $\leq 4$

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.