Given an $m imes n$ integer matrix grid containing only $0$’s and $1$’s, return the total number of corner rectangles.

A corner rectangle consists of $4$ distinct grid cells at coordinates $(r_1, c_1)$, $(r_1, c_2)$, $(r_2, c_1)$, and $(r_2, c_2)$ such that $r_1 < r_2$, $c_1 < c_2$, and all $4$ corresponding cells in grid have a value of $1$.

Constraints:

• m == grid.length

• n == grid[i].length

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

• grid[i][j] is either $0$ or $1$.

• The number of $1$’s in grid is in the range $[1, 6000]$.

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.