Cakeminator

You are given a rectangular cake, represented as an r × c grid. Each cell either has an evil strawberry, or is empty. For example, a 3 × 4 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.

Input

The first line contains two integers r and c (2 ≤ r, c ≤ 10), 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:

• '.' character denotes a cake cell with no evil strawberry;
• 'S' character denotes a cake cell with an evil strawberry.

Output

Output the maximum number of cake cells that the cakeminator can eat.

Examples

Input

3 4
S...
....
..S.

Output

8

Note

For the first example, one possible way to eat the maximum number of cake cells is as follows (perform 3 eats).

分析：

剩下的不能吃的某个草莓的特点：所在行必有一个坏掉的草莓，所在列也必有一个坏掉的草莓，所以可以由两个坏掉的草莓求出一个不能吃的草莓，也就是说两个坏掉的草莓的行列交叉点是一个不能吃的草莓。我们求出所有的不能吃的加上坏掉的就是不满足条件的，然后总数一减就求出来了；

#include<iostream>
#include<cstring>
#include<string>
using namespace std;
int main() {
	int n,m,cnt=0;
	char map[15][15];
	int st[15][15]= {0},tx[120],ty[120];
	scanf("%d %d",&n,&m);
	getchar();//不能漏掉，否则读入会出错 
	for(int i=1; i<=n; i++) {
		for(int j=1; j<=m; j++) {
			scanf("%c",&map[i][j]);
			if(map[i][j]=='S') {
				cnt++;
				st[i][j]=1;
				tx[cnt]=i;
				ty[cnt]=j;//所有坏掉的草莓的行与列用数组保存一下 
			}
		}
		getchar();//把回车吃掉 
	}
	int x=cnt;//此时，求出的cnt是坏掉的 
	for(int i=1; i<=x; i++)
		for(int j=1; j<=x; j++) {
			if(!st[tx[i]][ty[j]]) {
				cnt++;
				st[tx[i]][ty[j]]=1;//求交叉点的数量
			}
		}
	cout<<n*m-cnt<<endl;
	return 0;
}