import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.numeric, std.math, std.random;
import core.bitop;

string FMT_F = "%.10f";

static string[] s_rd;
T RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
string RDR()() { return readln.chomp; }
T[] ARR(T = long)(in string str, T fix = 0) { auto r = str.split.to!(T[]); r[] += fix; return r; }
T[] RDA(T = long)(T fix = 0) { auto r = readln.chomp.split.to!(T[]); r[] += fix; return r; }
T[][] RDA2(T = long)(size_t n, T[] fix = []) { auto r = new T[][](n); foreach (i; 0..n) { r[i] = readln.chomp.split.to!(T[]); foreach (j, e; fix) r[i][j] += e; } return r; }
size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;}
size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; }

bool inside(T)(T x, T b, T e) { return x >= b && x < e; }
long lcm(long x, long y) { return x * (y / gcd(x, y)); }

long mod = 10^^9 + 7;
//long mod = 998244353;
//long mod = 1_000_003;
void moda(ref long x, long y) { x = (x + y) % mod; }
void mods(ref long x, long y) { x = ((x + mod) - (y % mod)) % mod; }
void modm(ref long x, long y) { x = (x * y) % mod; }

struct UnionFind
{
	void init(int n) { par = new int[](n); foreach (i; 0..n) par[i] = i; cnt = new int[](n); fill(cnt, 1); }
	int root(int i) { return par[i] == i ? i : (par[i] = root(par[i])); }
	bool same(int i, int j) { return root(i) == root(j); }
	void unite(int i, int j) { i = root(i); j = root(j); if (i == j) return; par[i] = j; cnt[j] += cnt[i]; }
	int size(int i) { return cnt[root(i)]; }
	int[] par, cnt;
}

void main()
{
	auto H = RD!int;
	auto W = RD!int;
	auto s = new string[](H);
	foreach (i; 0..H)
		s[i] = RD!string;

	UnionFind uf;
	uf.init(H*W);
	foreach (y; 0..H)
	{
		int id = y * W;
		foreach (x; 0..W-1)
		{
			if (s[y][x] != s[y][x+1])
				uf.unite(id+x, id+x+1);
		}
		if (y != H-1)
		{
			foreach (x; 0..W)
			{
				if (s[y][x] != s[y+1][x])
					uf.unite(id+x, id+x+W);
			}
		}
	}

	auto cnt = new long[][](H*W, 2);
	foreach (y; 0..H)
	{
		foreach (x; 0..W)
		{
			auto r = uf.root(y*W+x);
			auto pos = s[y][x] == '#' ? 1 : 0;
			++cnt[r][pos];
		}
	}

	long ans;
	foreach (i; 0..cnt.length)
	{
		ans += cnt[i][0] * cnt[i][1];
	}

	writeln(ans);
	stdout.flush();
	debug readln();
}