There is a grid with H rows and W columns, where each square is painted black or white.

You are given H strings S_1, S_2, ..., S_H, each of length W. If the square at the i-th row from the top and the j-th column from the left is painted black, the j-th character in the string S_i is `#`; if that square is painted white, the j-th character in the string S_i is `.`.

Find the number of pairs of a black square c_1 and a white square c_2 that satisfy the following condition:

* There is a path from the square c_1 to the square c_2 where we repeatedly move to a vertically or horizontally adjacent square through an alternating sequence of black and white squares: black, white, black, white...

Constraints

* 1 \leq H, W \leq 400
* |S_i| = W (1 \leq i \leq H)
* For each i (1 \leq i \leq H), the string S_i consists of characters `#` and `.`.

Input

Input is given from Standard Input in the following format:


H W
S_1
S_2
:
S_H


Output

Print the answer.

Examples

Input

3 3
.#.
..#
#..


Output

10


Input

3 3
.#.
..#
..


Output

10


Input

2 4
....
....


Output

0


Input

4 3


...


Output

6
#include <bits/stdc++.h>

#define fir first
#define sec second

typedef std::pair<int, int> Pii;

const int DX[] = {-1, 0, 0, 1};
const int DY[] = {0, -1, 1, 0};

char S[410][410];
int H, W, vis[410][410];

long long BFS(int, int);

int main() {
	scanf("%d%d", &H, &W);
	for (int i = 0; i < H; i++) scanf("%s", S[i]);

	long long ans = 0;
	for (int i = 0; i < H; i++)
		for (int j = 0; j < W; j++)
			if (!vis[i][j]) ans += BFS(i, j);

	printf("%lld\n", ans);
	
	return 0;
}

long long BFS(int sx, int sy) {
	std::queue<Pii> que;
	long long cnt1, cnt2;
	for (cnt1 = cnt2 = 0, vis[sx][sy] = 1, que.push(Pii(sx, sy)); !que.empty(); ) {
		Pii now = que.front(); que.pop();
		S[now.fir][now.sec] == '#' ? ++cnt1 : ++cnt2;
		for (int k = 0; k < 4; k++) {
			int nx = now.fir + DX[k], ny = now.sec + DY[k];
			if (nx >= 0 && nx < H && ny >=0 && ny < W && !vis[nx][ny] && S[nx][ny] ^ S[now.fir][now.sec]) {
				vis[nx][ny] = 1;
				que.push(Pii(nx, ny));
			}
		}
	}

	return cnt1 * cnt2;
}
