Sum of all Submatrices

1 <= N <=30
0 <= A[i][j] <= 10

Single argument representing a 2-D array A of size N x N.

Return an integer denoting the sum of all possible submatrices in the given matrix.

Input 1:
A = [ [1, 1]
      [1, 1] ]

Input 2:
A = [ [1, 2]
      [3, 4] ]

Output 1:
16

Output 2:
40

Explanation 1:
Number of submatrices with 1 elements = 4, so sum of all such submatrices = 4 * 1 = 4
Number of submatrices with 2 elements = 4, so sum of all such submatrices = 4 * 2 = 8
Number of submatrices with 3 elements = 0
Number of submatrices with 4 elements = 1, so sum of such submatrix = 4
Total Sum = 4+8+4 = 16

Explanation 2:
The submatrices are [1], [2], [3], [4], [1, 2], [3, 4], [1, 3], [2, 4] and [[1, 2], [3, 4]].
Total sum = 40

public class Solution {
    public int solve(int[][] A) {
        int n = A.length;
        int totalSum = 0;
 
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                totalSum += A[i][j] * (i + 1) * (j + 1) * (n - i) * (n - j);
            }
        }
 
        return totalSum;
    }
}

def solve(A):
    n = len(A)
    total_sum = 0
 
    for i in range(n):
        for j in range(n):
            total_sum += A[i][j] * (i + 1) * (j + 1) * (n - i) * (n - j)
 
    return total_sum

function solve(A) {
    const n = A.length;
    let totalSum = 0;
 
    for (let i = 0; i < n; i++) {
        for (let j = 0; j < n; j++) {
            totalSum += A[i][j] * (i + 1) * (j + 1) * (n - i) * (n - j);
        }
    }
 
    return totalSum;
}