B'Sereja has an n xe2 x80 x89 xc3 x97 xe2 x80 x89m rectangular table a, each cell of the table contains a zero or a number one. Sereja wants his table to meet the following requirement: each connected component of the same values forms a rectangle with sides parallel to the sides of the table. Rectangles should be filled with cells, that is, if a component form a rectangle of size h xe2 x80 x89 xc3 x97 xe2 x80 x89w, then the component must contain exactly hw cells. A connected component of the same values is a set of cells of the table that meet the following conditions: Can Sereja change the values of at most k cells of the table so that the table met the described requirement? What minimum number of table cells should he change in this case? The first line contains integers n, m and k (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n, xe2 x80 x89m xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89100; 1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89k xe2 x80 x89 xe2 x89 xa4 xe2 x80 x8910). Next n lines describe the table a: the i-th of them contains m integers ai1, xe2 x80 x89ai2, xe2 x80 x89..., xe2 x80 x89aim (0 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89ai, xe2 x80 x89j xe2 x80 x89 xe2 x89 xa4 xe2 x80 x891) -- the values in the cells of the i-th row. Print -1, if it is impossible to meet the requirement. Otherwise, print the minimum number of cells which should be changed.'...