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

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int H = sc.nextInt();
        int W = sc.nextInt();
        char[][] c = new char[H][W];
        ArrayList<int[]> delta = new ArrayList<int[]>();
        int[] arr_1 = {1, 0};int[] arr_2 = {0, 1};int[] arr_3 = {-1, 0};int[] arr_4 = {0, -1};
        delta.add(arr_1);delta.add(arr_2);delta.add(arr_3);delta.add(arr_4);
        for (int i=0;i<H;i++) {
            String S = sc.next();
            for (int j=0;j<W;j++) {
                c[i][j] = S.charAt(j);
            }
        }

        long ans = 0L;
        boolean[][] flag = new boolean[H][W];
        for (int i=0;i<H;i++) {
            for (int j=0;j<W;j++) {
                if (c[i][j]=='.') continue;
                if (flag[i][j]) continue;

                ArrayDeque<int[]> q = new ArrayDeque<int[]>();
                int[] first = {i, j, 0};
                q.add(first);
                int b_cnt = 0;
                int w_cnt = 0;
                while (!q.isEmpty()) {
                    int[] rem = q.poll();
                    if (rem[0]<0 || H<=rem[0] || rem[1]<0 || W<=rem[1]) continue;
                    if (rem[2]%2==0 && c[rem[0]][rem[1]]=='.') continue;
                    if (rem[2]%2==1 && c[rem[0]][rem[1]]=='#') continue;
                    if (flag[rem[0]][rem[1]]) continue;
                    flag[rem[0]][rem[1]] = true;
                    if (rem[2]%2==0) b_cnt++;
                    if (rem[2]%2==1) w_cnt++;
                    for (int[] del : delta) {
                        int[] add = {rem[0]+del[0], rem[1]+del[1], rem[2]+1};
                        q.add(add);
                    }
                }
                // System.out.println("b, w "+b_cnt+" "+w_cnt);

                ans += (long)b_cnt*w_cnt;
            }
        }
        System.out.println(ans);
    }
}