A strange printer can print on a grid of dimensions m $ imes$ n. In each operation, the printer chooses a color and paints a solid rectangle of that color onto the grid, overwriting any colors previously present in that rectangular region. Each color can be printed at most once.

Given an m $ imes$ n integer matrix targetGrid, return true if it is possible to print targetGrid using this printer, or false otherwise.

Constraints:

• m $==$ targetGrid.length

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

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

• $1 \leq$ targetGrid[row][col] $\leq 60$

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.