Holey fabric#1069
On the table lay several pieces of fabric, not overlapping with each other. These pieces may have holes, including holes so large that they could fit an entire piece of fabric. A black and white image of the table's surface is provided: areas covered with fabric are represented by , and empty spaces by dots. Each piece of fabric is represented by a -connected region of symbols, meaning that symbols are connected horizontally or vertically, but not diagonally.
.***..***
.*.*.**.*
.***.*.**
*...**.*.
In the diagram, there are three pieces: one without holes, and two with one hole each. The first piece has an area of , and the second piece has an area of .
Your task is to find the piece with the greatest number of holes. A hole is a -connected region of dots completely surrounded by symbols. If several pieces have the same maximum number of holes, choose the one with the smallest area.
The first line contains two numbers and separated by spaces. The next lines each contain characters. The characters in these lines are either or .
1 \leq W, H \leq 100.
Print one integer — the area of the smallest piece among the ones with the greatest number of holes. If there are no pieces with holes, output zero.
Example 1