var obj = init();
Main();
function nextInt(){return myconv(next(),1);}
function nextStrArray(){return myconv(next(),2);}//半角スペース分割
function nextIntArray(){return myconv(next(),4);}//半角スペース + 数値化
function nextCharArray(){return myconv(next(),6);}//1文字分割
function next(){return obj.next();}
function hasNext(){return obj.hasNext();}
function myin(){return require("fs").readFileSync("/dev/stdin", "utf8").trim().split("\n");}
function init(){
  var inputFile = myin();
  var returnObj = {
    "list" : inputFile, "index" : 0, "max" : inputFile.length,
    "hasNext" : function(){return (this.index < this.max);},
    "next" : function(){if(!this.hasNext()){throw "ArrayIndexOutOfBoundsException これ以上ないよ";}else{var returnInput = this.list[this.index];this.index++;return returnInput;}}
  };
  return returnObj;
}
function myout(t){console.log(t);}//標準出力
function myerr(t){console.error(t);}//標準エラー出力
//[no]要素の扱い。数値型
//不明値、異常時:引数そのまま返す　1:数値へ変換
//2:半角SPで分割 4:半角SPで分割し、数値配列へ
//6:1文字で分割  7:1文字で分割し、数値配列へ
//8:半角SPで結合 9:改行で結合 0:文字なしで結合
function myconv(i,no){try{switch(no){case 1:return parseInt(i);case 2:return i.split(" ");case 4:return i.split(" ").map((a)=>Number(a));case 6:return i.split("");case 7:return i.split("").map((a)=>Number(a));case 8:return i.join(" ");case 9:return i.join("\n");case 0:return i.join("");default:return i;}}catch(e){return i;}}
function Main(){
  var one = nextIntArray();
	var H = one[0];
	var W = one[1];
	var list = new Array(H);
	var access = new Array(H);
	for(var i = 0; i < H; i++){
		list[i] = nextCharArray();
		access[i] = new Array(W).fill(false);
	}
	var dy = [-1,0,1,0];
	var dx = [0,-1,0,1];
	var group = [];
	for(var i = 0; i < H; i++){
		for(var j = 0; j < W; j++){
			if(!access[i][j] && list[i][j] == "#"){
				group.push({
					white : 0,
					black : 1
				});
				bfs(i,j);
			}
		}
	}
	//myerr(group);
	var output = 0;
	for(var i = 0; i < group.length; i++){
		output += group[i]["white"] * group[i]["black"];
	}
	myout(output);
	function bfs(y,x){
		var queue = [[y,x]];
		access[y][x] = true;
		list[y][x] = 0;
		while(queue.length > 0){
			var tmp = queue.shift();
			for(var i = 0; i < 4; i++){
				var nextY = tmp[0] + dy[i];
				var nextX = tmp[1] + dx[i];
				if(nextY >= 0 && nextY < H && nextX >= 0 && nextX < W){
					if(!access[nextY][nextX]){
						if(list[tmp[0]][tmp[1]] % 2 == 0 && list[nextY][nextX] == "."){
							list[nextY][nextX] = list[tmp[0]][tmp[1]] + 1;
							group[group.length - 1]["white"]++;
							queue.push([nextY,nextX]);
							access[nextY][nextX] = true;
						}else if(list[tmp[0]][tmp[1]] % 2 == 1 && list[nextY][nextX] == "#"){
							list[nextY][nextX] = list[tmp[0]][tmp[1]] + 1;
							group[group.length - 1]["black"]++;
							queue.push([nextY,nextX]);
							access[nextY][nextX] = true;
						}
					}
				}
			}
		}
	}
}