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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.StringTokenizer;

public class Main {

	public static void main(String[] args) throws IOException {
		Main mainObj = new Main();
		mainObj.solve();
	}

	public void solve() throws IOException {
		FastScanner fs = new FastScanner();
		int h = fs.nextInt();
		int w = fs.nextInt();
		int[][] board = new int[h][w];
		
		for(int i = 0; i < h; i++) {
			String[] row = fs.next().split("");
			for(int j = 0; j < w; j++) {
				if(row[j].equals(".")) {
					board[i][j] = 1;
				}else {
					board[i][j] = 0;
				}
			}
		}
		
		long ans = 0;
		for(int i = 0; i < h; i++) {
			for(int j = 0; j < w;j++) {
				if(board[i][j] != -1) {
					ArrayList<Integer> pointSet = new ArrayList<>();
					makeReachableNodeSet(i, j, board, h, w, pointSet);
					
					if(pointSet.size() > 1) {
						long white =  pointSet.stream().filter(val -> val.intValue() == 1).count();
						long black = pointSet.size() - white;
						ans += black*white;
					}
				}
			}
		}
		System.out.println(ans);
	}
	
	public void makeReachableNodeSet(int i, int j, int[][] graph, int h, int w, ArrayList<Integer> pointList) {
		
		int hereVal = graph[i][j];
		
		if(hereVal == -1) {
			return;
		}
		
		pointList.add(hereVal);
		graph[i][j] = -1;
		
		if(i > 0) {
			if(graph[i-1][j] >= 0 && hereVal != graph[i-1][j]) {
				makeReachableNodeSet(i-1, j, graph, h, w, pointList);
			}
		}
		
		if(i < h - 1) {
			if(graph[i+1][j] >= 0 && hereVal != graph[i+1][j]) {
				makeReachableNodeSet(i+1, j, graph,h,w, pointList);
			}
		}
		
		if(j > 0) {
			if(graph[i][j-1] >= 0 && hereVal != graph[i][j-1]) {
				makeReachableNodeSet(i, j -1, graph, h,w, pointList);
			}
		}
		
		if(j < w - 1) {
			if(graph[i][j + 1] >= 0 && hereVal != graph[i][j+1]) {
				makeReachableNodeSet(i, j+1, graph, h,w, pointList);
			}
		}
	}

//	class Point{
//		int color;
//		int x;
//		int y;
//		
//		Point(int color, int x, int y){
//			this.color = color;
//			this.x = x;
//			this.y = y;
//		}
//	}

	public class FastScanner {

		BufferedReader reader;
		private StringTokenizer st;

		public FastScanner() {
			st = null;
			reader = new BufferedReader(new InputStreamReader(System.in));
		}

		public String next() throws IOException {
			if (st == null || !st.hasMoreElements()) {
				st = new StringTokenizer(reader.readLine());
			}
			return st.nextToken();
		}

		public String nextLine() throws IOException {
			st = null;
			String readLine = null;
			readLine = reader.readLine();
			return readLine;
		}

		public int nextInt() throws NumberFormatException, IOException {
			return Integer.parseInt(next());
		}

		public long nextLong() throws NumberFormatException, IOException {
			return Long.parseLong(next());
		}

		public int[] nextIntArr(int n) throws NumberFormatException, IOException {
			int[] retArr = new int[n];
			for (int i = 0; i < n; i++) {
				retArr[i] = nextInt();
			}
			return retArr;
		}

		public long[] nextLongArr(int n) throws NumberFormatException, IOException {
			long[] retArr = new long[n];
			for (int i = 0; i < n; i++) {
				retArr[i] = nextLong();
			}
			return retArr;
		}

		public void close() throws IOException {
			reader.close();
		}
	}

}
