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
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;++i)
typedef long long ll;
using namespace std;

const int LIM = 400, dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
int h, w;
string s[LIM];
bool visited[LIM][LIM];
ll ans, bk, wt;

void dfs(int sy, int sx) {
    visited[sy][sx] = true;
    if (s[sy][sx] == '.') wt++; else bk++;
    
    rep(i, 4) {
        int ny = sy + dy[i], nx = sx + dx[i];
        if (ny < 0 || ny >= h || nx < 0 || nx >= w || visited[ny][nx]) continue;
        if (s[sy][sx] != s[ny][nx]) dfs(ny, nx);
    }
}

int main() {
    cin >> h >> w;
    rep(i, h) cin >> s[i];
    rep(i, h) {
        rep(j, w) {
            if (s[i][j] == '#') {
                bk = wt = 0;
                dfs(i, j);
                ans += bk * wt;
            }
        }
    }
    cout << ans << endl;
    return 0;
}
