B'You are given a rectangular cake, represented as an r xe2 x80 x89 xc3 x97 xe2 x80 x89c grid. Each cell either has an evil strawberry, or is empty. For example, a 3 xe2 x80 x89 xc3 x97 xe2 x80 x894 cake may look as follows: The cakeminator is going to eat the cake! Each time he eats, he chooses a row or a column that does not contain any evil strawberries and contains at least one cake cell that has not been eaten before, and eats all the cake cells there. He may decide to eat any number of times. Please output the maximum number of cake cells that the cakeminator can eat. The first line contains two integers r and c (2 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89r, xe2 x80 x89c xe2 x80 x89 xe2 x89 xa4 xe2 x80 x8910), denoting the number of rows and the number of columns of the cake. The next r lines each contains c characters -- the j-th character of the i-th line denotes the content of the cell at row i and column j, and is either one of these: Output the maximum number of cake cells that the cakeminator can eat. For the first example, one possible way to eat the maximum number of cake cells is as follows (perform 3 eats).'...