Matrix Element Cube Sum Problem

For a given M x N sized 2D array 'MATRIX', find and return the value of (i * i + j * j) for elements where the sum of the cubes of its digits equals the element itself. Here, 'i' represents the row number ranging from '0' to 'M-1', and 'j' represents the column number ranging from '0' to 'N-1'.

Example:

Input:

T = 2
M = 3, N = 3
MATRIX = [[153, 99, 1], [0, 28, 999], [370, 441, 370]]
M = 2, N = 2
MATRIX = [[370, 8208], [9474, 1634]]

Output:

4, 12
0, 4

Explanation:

In the first test case, for the element 153, since 1³ + 5³ + 3³ = 153, the output is 0*0 + 0*0 = 0. Similarly, for element 370 in position (2,0), the output is 2*2 + 0*0 = 4.

Constraints:

• 1 <= T <= 10
• 1 <= M <= 100
• 1 <= N <= 50
• 1 <= ELEMENT <= 10^9

Note:

If no element satisfies the condition, return -1.
Implement the function without printing anything; the output handling is already managed.