Given an $m \times n$ integer matrix matrix and an integer k, return the maximum sum of a rectangular submatrix whose sum is less than or equal to k.

It is guaranteed that there will be at least one rectangular submatrix with a sum no larger than k.

Constraints:

• m == matrix.length

• n == matrix[i].length

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

• $-100 \leq$ matrix[i][j] $\leq 100$

• $-10^5 \leq$ k $\leq 10^5$

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.