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.Arrays;
import java.util.Scanner;

class C {
    static class UnionFind {
        final int[] tree;

        public UnionFind(int size) {
            tree = new int[size];
            Arrays.fill(tree, -1);
        }

        int root(int x) {
            return tree[x] < 0 ? x : (tree[x] = root(tree[x]));
        }

        void union(int x, int y) {
            x = root(x);
            y = root(y);
            if (tree[x] > tree[y])
                union(y, x);
            else if (x != y) {
                tree[x] += tree[y];
                tree[y] = x;
            }
        }
    }

    public static void main(String... args) {
        final Scanner sc = new Scanner(System.in);
        final int H = sc.nextInt();
        final int W = sc.nextInt();
        final char[][] S = new char[H][];
        for (int i = 0; i < H; i++)
            S[i] = sc.next().toCharArray();
        final UnionFind uf = new UnionFind(H * W);
        for (int i = 0; i < H; i++)
            for (int j = 0; j < W; j++) {
                if (i > 0 && S[i - 1][j] != S[i][j])
                    uf.union(i * W + j, (i - 1) * W + j);
                if (j > 0 && S[i][j - 1] != S[i][j])
                    uf.union(i * W + j, i * W + j - 1);
            }
        final int[][] b = new int[H][W];
        final int[][] w = new int[H][W];
        for (int i = 0; i < H; i++)
            for (int j = 0; j < W; j++) {
                final int r = uf.root(i * W + j);
                if (S[i][j] == '.')
                    w[r / W][r % W]++;
                else
                    b[r / W][r % W]++;
            }
        long ans = 0;
        for (int i = 0; i < H; i++)
            for (int j = 0; j < W; j++)
                ans += (long) w[i][j] * b[i][j];
        System.out.println(ans);
    }
}
public class Main {
    public static void main(String... args) {
        C.main();
    }
}
