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.awt.Point;
import java.util.stream.*;
import java.util.*;

public class Main {
    static Scanner scanner = new Scanner(System.in);

    public static void main(String[]$) {
        int h = scanner.nextInt(), w = scanner.nextInt();
        long ans = 0;
        char[][] c = IntStream.range(0, h).mapToObj(i -> scanner.next().toCharArray()).toArray(char[][]::new);
        for (int i = 0; i < h; i++) {
            for (int j = 0; j < w; j++) {
                if (c[i][j] != '\0') {
                    long bl = 0, wh = 0;
                    Deque<Point> deque = new ArrayDeque<>(Collections.singleton(new Point(i, j)));
                    while (!deque.isEmpty()) {
                        Point p = deque.pollLast();
                        char ch = c[p.x][p.y];
                        if (ch == '\0') continue;
                        else if (ch == '#') bl++;
                        else if (ch == '.') wh++;
                        c[p.x][p.y] = '\0';
                        if (p.x > 0 && ch != c[p.x - 1][p.y])
                            deque.push(new Point(p.x - 1, p.y));
                        if (p.x + 1 < h && ch != c[p.x + 1][p.y])
                            deque.push(new Point(p.x + 1, p.y));
                        if (p.y > 0 && ch != c[p.x][p.y - 1])
                            deque.push(new Point(p.x, p.y - 1));
                        if (p.y + 1 < w && ch != c[p.x][p.y + 1])
                            deque.push(new Point(p.x, p.y + 1));
                    }
                    ans += bl * wh;
                }
            }
        }
        System.out.println(ans);
    }
}