You are given an $m \times n$ integer matrix grid and an integer k.

A submatrix is considered sorted if every row within it is sorted in non increasing order.

Return the number of sorted submatrices such that the maximum element in the submatrix is at most k.

Constraints:

• $1 \leq m =$ grid.length $\leq 10^3$

• $1 \leq n =$ grid[i].length $\leq 10^3$

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

• $1 \leq$ k $\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.