#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vint;
typedef vector<double> vd;
typedef vector<ll> vll;
typedef vector<string> vstr;
typedef vector<vector<int>> vvint;
typedef vector<pair<int, int>> vpii;
typedef vector<pair<ll, ll>> vpll;
typedef priority_queue<int, vector<int>, greater<int>> spqint; //小さい順に取り出し
typedef priority_queue<ll, vector<ll>, greater<ll>> spqll;     //小さい順に取り出し
typedef priority_queue<int, vector<int>, less<int>> bpqint;    //大きい順に取り出し
typedef priority_queue<ll, vector<ll>, less<ll>> bpqll;        //大きい順に取り出し

#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define FOR(i, a, b) for (ll i = (ll)a; i < (ll)b; i++)
#define IREP(i, v) for (auto i = (v).begin(); i != (v).end(); i++)
#define FI first
#define SE second
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define PF push_front
#define TS to_string
#define BS binary_search
#define LB lower_bound
#define UB upper_bound
#define NP next_permutation
#define ALL(v) (v).begin(), (v).end()
#define SZ(x) (ll) x.size()
#define SP(x) setprecision((ll)x)


int INF = 1e9;
int NIL = -1;
ll MOD = 1000000007;
ll LINF = 1e18;
double EPS = 1e-9;
double PI = M_PI;
int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; } //最大公約数
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }     //最小公倍数

void yes(){ cout << "Yes" << endl;}
void no(){ cout << "No" << endl;}
//-----------------------------------------
//-----------------------------------------
int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    std::chrono::system_clock::time_point start,end;
    start = std::chrono::system_clock::now();

    ll h, w;
    cin >> h >> w;
    vector<string> str(h);
    vector<vll> seen(h,vll(w,0));
    vector<vll> color(h,vll(w,0));
    int col = 0;
    queue<pll> que;

    REP(i,h){
        cin >> str[i];
    }

    REP(i,h){
        REP(j,w){
            if(seen[i][j]==0){
                que.push(MP(i,j));
                seen[i][j] = 1;
                color[i][j] = col;
                while(!que.empty()){
                    int x, y ;
                    x = que.front().FI;
                    y = que.front().SE;
                    que.pop();
                    REP(k,4){
                        int nx = x + dx[k];
                        int ny = y + dy[k];
                        if(nx>=0 && nx<h && ny>=0 && ny<w && seen[nx][ny]==0){
                            if(str[x][y]!=str[nx][ny]){
                                seen[nx][ny] = 1;
                                que.push(MP(nx,ny));
                                color[nx][ny] = col;
                            }
                        }
                    }
                }
            }
            col++;
        }
    }
    /*
    REP(i,h){
        REP(j,w){
            cout << color[i][j];
        }
        cout << endl;
    }
    */
    


    ll ans = 0;
    vll cola(col,0);
    vll colb(col,0);

    REP(i,h){
        REP(j,w){
            if(str[i][j]=='#'){
                cola[color[i][j]]++;
            }
            else{
                colb[color[i][j]]++;
            }
        }
    }
    REP(i,col){
        ans += cola[i]*colb[i];
    }

    cout << ans <<endl;





    end = std::chrono::system_clock::now();
    auto elapsed = std::chrono::duration_cast< std::chrono::milliseconds >(end - start).count();
    //std::cout << elapsed <<"ms"<< std::endl;

    

    return 0;
}



Measured memory_bytes: 8496