[Hidden]

#### Description

You have written many programs to search mazes so matrix search shouldn’t be any different, or will it?
The Problem:
An integer matrix with R rows and C columns has sub matrices. We want to select a sub matrix with sum (the sum of all integers in it) greater than or equal to a given integer S. We want the size of the sub matrix to be the least possible. The size of a sub matrix is defined as the number of elements in that sub matrix (i.e., number of rows * number of columns in that sub matrix).

#### Input

The first input line consists of three integers R, C (1 ≤ R ≤ 100,000; 1 ≤ C ≤ 100,000; 1 ≤ R*C ≤ 100,000) and S. Next R lines contain the description of the matrix. Each of these R lines contains C integers separated by a single space. All integers (other than R and C) are between -109 and +109, inclusive.

#### Output

Print the size of the minimum sub matrix whose sum is greater or equal to the given S. If there is no such sub matrix, output -1.

#### Samples

Input Copy
3 3 26
1 2 3
4 5 6
7 8 9
Output
4

#### Source

UCF2019 PRACTICE
##### Problem Information

 Time Limit: 2000MS (C/C++,Others×2) Memory Limit: 128MB (C/C++,Others×2) Special Judge: No AC/Submit: 7 / 39 Tags:
##### Contests involved

 1037. UCF 2019 Practice