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.Scanner;

public class Main {

    static int H, W;
    static char[][] grid;
    static int[][] visited;
    static int[][] dir = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        H = sc.nextInt();
        W = sc.nextInt();
        grid = new char[H][W];
        for(int i = 0; i < H; i++) grid[i] = sc.next().toCharArray();
        sc.close();
        visited = new int[H][W];
        long ans = 0;
        for(int i = 0; i < H; i++){
            for(int j = 0; j < W; j++){
                long[] ret = new long[2];
                ret = dfs(i, j);
                ans += ret[0] * ret[1];
            }
        }
        System.out.println(ans);

    }
    private static long[] dfs(int i, int j) {
        long[] ret = new long[2];
        if(visited[i][j] == 1) return ret;
        visited[i][j] = 1;
        if(grid[i][j] == '.') ret[0]++;
        else ret[1]++;
        for(int[] d:dir){
            int ni = i +d[0];
            int nj = j +d[1];
            if(ni >=0 && ni <H && nj >=0 && nj <W){
                if(visited[ni][nj] == 0 && grid[ni][nj] != grid[i][j]){
                    long[] ret2 = dfs(ni, nj);
                    ret[0] += ret2[0];
                    ret[1] += ret2[1];
                }
            }
        }

        return ret;
    }

}
