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
import java.util.*;

public class Main {
	Scanner sc = new Scanner(System.in);
	int h, w;
	long bl = 0, wh = 0;
	void doIt() {
		h = sc.nextInt();
		w = sc.nextInt();
		String s[] = new String[h];
		long ans = 0;
		for(int i = 0; i < h; i++) {
			s[i] = sc.next();
		}
		char c[][] = new char[h][w];
		for(int j = 0; j < w; j++) {
			for(int i = 0; i < h; i++) {
				c[i][j] = s[i].charAt(j);
			}
		}
		for(int j = 0; j < w; j++) {
			for(int i = 0; i < h; i++) {
				if(c[i][j] != '!') {
					change(i, j, c);
					ans += bl * wh;
					bl = 0; wh = 0;
				}
			}
		}
		System.out.println(ans);
	}
	
	void change(int i, int j, char[][] c) {
		if(c[i][j] == '!') return;
		else if(c[i][j] == '#') bl++;
		else if(c[i][j] == '.') wh++;
		char cp = c[i][j];
		c[i][j] = '!';
		//System.out.println(i +" "+ j);
		if(i - 1 >= 0 && cp != c[i - 1][j]) change(i - 1, j, c);
		if(i + 1 < h && cp != c[i + 1][j]) change(i + 1, j, c);
		if(j - 1 >= 0 && cp != c[i][j - 1]) change(i, j - 1, c);
		if(j + 1 < w && cp != c[i][j + 1]) change(i, j + 1, c);
	}
	
	public static void main(String[] args) {
		new Main().doIt();
	}
}
