Given a $0$ indexed $2$D integer matrix grid of size n imes m, construct a product matrix p of the same dimensions where each element p[i][j] is equal to the product of all elements in grid except grid[i][j], modulo $12345$.

Return the product matrix p.

Constraints:

• $1 \leq$ n $==$ grid.length $\leq 10^5$

• $1 \leq$ m $==$ grid[i].length $\leq 10^5$

• $2 \leq$ n * m $\leq 10^5$

• $1 \leq$ grid[i][j] $\leq 10^9$

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.