You are given a two dimensional integer array matrix of size m $ imes$ n, and an integer k.

The XOR coordinate value of a cell $(a, b)$ is computed as the bitwise XOR sum of all elements matrix[i][j] where $0 \leq i \leq a$ and $0 \leq j \leq b$ ($0$ indexed).

Return the kth largest XOR coordinate value ($1$ indexed) among all possible coordinates $(a, b)$ where $0 \leq a <$ m and $0 \leq b <$ n.

Constraints:

• m == matrix.length

• n == matrix[i].length

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

• $0 \leq$ matrix[i][j] $\leq 10^6$

• $1 \leq$ k $\leq$ m $ imes$ n

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.