Problem I
Reapportionment

Your task is to consider towns of various sizes and determine if there is at least one way to divide up the blocks into contiguous wards of equal population. All towns will be rectangular and consist of no more than 25 blocks. The number of desired wards may vary.

A block is considered adjacent to another block if it shares an edge. A contiguous ward is a collection of blocks such that by starting at one, and only traveling to adjacent blocks in the ward, you can get to every block in the ward.

Input

The first line contains two integers $R$ and $C$ ($1 \leq R \times C \leq 25$) indicating the number of rows and columns of the rectangular town. The next line contains an integer $W$ ($1 \leq W \leq R \times C$) indicating the number of wards desired for the town. The next $R$ lines each contains $C$ non-negative integers representing the populations of the blocks of the rows, starting at the top row. The blocks in each row are listed from left to right. The total population of the town will be no more than $1{,}000{,}000$.

Output

If it is possible to do the reapportionment with the given input, print “Yes". Otherwise print “No".

5 5
3
1 4 12 7 5
8 10 9 1 2
2 4 1 2 3
3 3 5 4 3
1 2 4 2 1

Yes