#include "bits/stdc++.h"
#define YES "YES"
#define NO "NO"
#define YESNO OUT(three(solve(),YES,NO))
#define ECHO OUT(solve())
#define three(A,B,C) ((A)?(B):(C))
#define FOR(i,a,b)  for(LL i=(a);i< (LL)(b);i++)
#define EFOR(i,a,b) for(LL i=(a);i<=(LL)(b);i++)
#define RFOR(i,a,b) for(LL i=(b);i>=(LL)(a);i--)
#define REP(i,b) FOR(i,zero,b)
#define EREP(i,b) EFOR(i,zero,b)
#define RREP(i,b) RFOR(i,b,zero)
#define ALL(c) c.begin(),c.end()
#define UNIQUE(c) sort(ALL(c));c.erase(unique(ALL(c)),c.end())
#define MAX(c) (*max_element(ALL(c)))
#define MIN(c) (*min_element(ALL(c)))
#define MP make_pair
#define FI first
#define SE second
#define SI(x) (LL(x.size()))
#define PB push_back
#define DEBUG(a) OUT(a)
#define DEBUG2(a,b) OUT2(a,b)
#define cat cout << __LINE__ << endl
#define OUT(a) cout << (a) << endl
#define OUT2(a,b) cout << (a) <<" "<<(b) << endl
#define zero 0LL
#define int long long
#define pb emplace_back
#define eb pb
using namespace std;
template<typename T> inline void maximize(T &a, T b) { a = max(a, b); }
template<typename T> inline void minimize(T &a, T b) { a = min(a, b); }
template<typename T> inline bool middle(T a, T b, T c) { return b <= a && a <= c; }
template<class T> inline bool MX(T &l, const T &r) { return l < r ? l = r, 1 : 0; }
template<class T> inline bool MN(T &l, const T &r) { return l > r ? l = r, 1 : 0; }
typedef int LL;
typedef double ld;
typedef int ut;
typedef vector<ut> VI;
typedef vector<VI> VII;
typedef pair<ut, ut> pr;
typedef pair<ut, pr> ppr;
typedef vector<pr> Vpr;
typedef vector<ppr> Vppr;
typedef priority_queue<ppr, Vppr,greater<ppr> > PQ;
inline void outputVI(VI x) { REP(i, SI(x)) { cout << three(i, " ", "") << x[i]; }OUT(""); }
const int SIZE1 = 5e5 + 1000;
const int SIZE2 = 2010;
const int SIZE3 = 430;
const int SIZE = SIZE3;
const int MAPSIZE = 40;
const LL p = 7 + 1e9;
const LL INF = 1LL << 60;
const long double EPS = 1e-7;
typedef pair<ld, ut> pld;
#define endl "\n" //インタラクティブでは消す
ut N, M, K, L, Q, D, H, W;
// ut A,B,C,D,E,F,G,H,I,J,O,P,Q,R,T,U;
class UnionFind {
public:

	vector<int> unions, talls, sents, dists, sizes[2];
	int size;
	UnionFind() {}
	UnionFind(int size) :size(size) {
		init();
	}
	void init() {
		unions = vector<int>(size);
		talls = vector<int>(size);
		sents = vector<int>(size);
		dists = vector<int>(size);
		REP(i,2) sizes[i] = vector<int>(size);
		FOR(i, 0, size) {
			unions[i] = i;
			sents[i] = 0;
			//			ns[i].PB(pr(0,1));
			talls[i] = 1;
		}
	}
	int find(int x, int t = 0) {
		if (unions[x] == x || sents[x] > t) return x;
		return find(unions[x], t);

	}
	int minisize(int x,int k) {
		if (x == unions[x]) return sizes[k][x];
		return minisize(find(x),k);
	}
	bool isFriend(int a, int b, int t = 0) {
		return find(a, t) == find(b, t);
	}
	void unite(int a, int b, int t = 0) {
		if (isFriend(a, b, t)) return;
		a = find(a, t);
		b = find(b, t);
		if (talls[a] < talls[b]) unite(b, a, t);
		else {
			REP(i,2)
			sizes[i][a] += sizes[i][b];
			sents[b] = t;
			talls[a] = max(talls[a], talls[b] + 1);
			unions[b] = a;
			dists[b] = 1;
			//			ns[a].PB(pr(t,ns[b].back().second+ns[a].back().second));
		}
	}
};
VI edges[SIZE];
LL vals[SIZE], maps2[SIZE2][SIZE2], answer = zero;
LL maps[SIZE2][SIZE2];
int C[SIZE];
LL solve() {
	cin >> H >> W;
	UnionFind uf = UnionFind(SIZE*SIZE);
	REP(i, H) {
		string s;
		cin >> s;
		REP(j, W) {
			maps[i + 1][j + 1] = 1+(s[j]=='#');
			LL val = (i+1) * SIZE + (j+1);
			uf.sizes[maps[i + 1][j + 1]-1][val] = 1;
		}
	}
	int dx[] = { 0,1,0,-1 };
	int dy[] = { 1,0,-1,0 };
	EFOR(i, 1, H) {
		EFOR(j, 1, W) {
			REP(k, 4) {
				int ny = i + dy[k];
				int nx = j + dx[k];
				if (maps[i][j] + maps[ny][nx] == 3) {
					uf.unite(i*SIZE+ j,ny*SIZE+nx);
				}
			}
		}
	}
	LL ans = 0;
	EFOR(i,1,H)
		EFOR(j, 1, W) {
		LL val = i * SIZE + j;
		if (uf.find(val) == val) ans += uf.minisize(val, 0)*uf.minisize(val, 1);
	}
	cout << ans << endl;
	return 0;
}




//!!!!!!!!!!!!!!!!!!!実装を詰める!!!!!!!!!!!!!!!!!!!!!!!!!
signed main() {

	ios_base::sync_with_stdio(false);
	cout << fixed << setprecision(0);
	solve();
	cin >> N;
	return 0;

}


Measured memory_bytes: 16000