Finding Seats

A group of $K$ friends is going to the movies. They arrived too late to get good tickets, so they are looking for a good way to sit close together. Since they are all science students, they decided to turn the choice of seats into an optimization problem instead of arguing about which tickets to buy.

The theater has $R$ rows of $C$ seats each, and they can see a map marking the seats that are currently available. They care only about sitting close to one another, so they will buy seats that minimize the extension of their group.

The extension is defined as the area of the smallest rectangle, with sides parallel to the rows and columns, that contains all of the chosen seats. The area of a rectangle is the number of seats it contains. Given the map of available seats, find the minimum possible extension.

The input consists of several test cases. Each test case begins with a line containing three positive integers $R$, $C$ and $K$ ($1 \le R, C \le 300$, $1 \le K \le R \times C$). The next $R$ lines each contain exactly $C$ characters. The $j$-th character of the $i$-th line is X if that seat is taken, or . if it is available. Every test case has at least $K$ available seats in total.

The input is terminated by a line with $R = C = K = 0$, which must not be processed.

Read the input from standard input.

For each test case, print a single line containing the minimum extension the group can achieve.

Write the output to standard output.