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
import java.util.*;
import java.io.*;

import static java.lang.System.in;

public class Main {
    static int[][] board;
    static boolean [][] vis;
    static int[] dx = new int[]{1,0,-1,0}, dy = new int[]{0,1,0,-1};
    static int H,W;
    public static void main(String[] args)throws IOException{
        Scanner sc = new Scanner(System.in);
        H = sc.nextInt(); W = sc.nextInt();
        vis = new boolean[H][W];
        board = new int[H][W];
        for(int i=0;i<H;i++){
            String cur = sc.next();
            for(int j=0;j<W;j++) {
                board[i][j] = cur.charAt(j)=='#'?1:0;
            }
        }
        long ans = 0;
        for(int i=0;i<H;i++){
            for(int j=0;j<W;j++){
                if(vis[i][j]||board[i][j]==0) continue;
                int total =1,white=0;
                for(int k=0;k<4;k++){
                    int r=i+dx[k],c=j+dy[k];
                    if(r>=0&&r<H&&c>=0&&c<W&&!vis[r][c]&&board[i][j]!=board[r][c]){
                        vis[i][j] = true;
                        int[] cur = dfs(i,j,r,c);
                        total += cur[0];
                        white += cur[1];
                    }
                }
                ans += ((long)(total-white))*((long)white);
            }
        }

        System.out.println(ans);
    }
    static int[] dfs(int fromR, int fromC, int row, int col){
        vis[row][col] = true;
        int tot=1;
        int white = 1-board[row][col];
        for(int k=0;k<4;k++){
            int r = row+dx[k], c = col+dy[k];
            if(r==fromR&&c==fromC) continue;
            if(r>=0&&r<H&&c>=0&&c<W&&!vis[r][c]&&board[row][col]!=board[r][c]){
                int[] cur = dfs(row,col,r,c);
                tot += cur[0];white += cur[1];
            }
        }
        return new int[]{tot,white};
    }
}
