PROGRAMMING:Sum of submatrix

For a matrix with R rows and C columns, a submatrix whose sum (the sum of all integers) is greater than or equal to the given integer s is obtained. We want the submatrix to be as small as possible. The size of a submatrix is defined as the number of elements in the submatrix (i.e. the size of the submatrix), i.e. the number of rows * the number of columns of the submatrix).
###Input format:
The first input line contains a positive integer T, which represents the number of test cases. The first line of each test case consists of three integers R, C, (1 ≤ R ≤ 100000, 1 ≤ C ≤ 100000, 1 ≤ R * C ≤ 100000), s, and the next r line, each line contains C integers separated by spaces, and all integers in the matrix are between - 10 ^ 9 and 10 ^ 9, including - 10 ^ 9.
###Output format:
For each test case, the output sum is the size of the minimum submatrix greater than or equal to a given S. if there is no such submatrix, output - 1.
###Input example:
Here is a set of inputs. For example:
```in
three
3 3 26
1 2 3
4 5 6
7 8 9
3 3 0
-1 -2 -3
-4 -5 -6
-7 -8 -9
2 2 1
-1 -2
0 2
```
###Output example:
The corresponding output is given here. For example:
```out
four
-1
one
```







answer：If there is no answer, please comment