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 int H;
  public static int W;
  public static char[][] S;
  public static boolean[][] used;
  public static long black;
  public static long white;

  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    H = sc.nextInt();
    W = sc.nextInt();
    S = new char[H][W];
    used = new boolean[H][W];
    for (int i = 0; i < H; i++) {
      S[i] = sc.next().toCharArray();
    }
    for (int i = 0; i < H; i++) {
      Arrays.fill(used[i], false);
    }
    long ans = 0;
    for (int i = 0; i < H; i++) {
      for (int j = 0; j < W; j++) {
        black = 0;
        white = 0;
        if (!used[i][j]) {
          dfs(i, j);
        }
        ans += black * white;
      }
    }
    System.out.println(ans);
  }

  public static void dfs(int i, int j) {
    if (used[i][j]) {
      return;
    }
    if (S[i][j] == '#') {
      black++;
    } else {
      white++;
    }
    used[i][j] = true;
    int[] dy = { -1, 0, 0, 1 };
    int[] dx = { 0, -1, 1, 0 };
    for (int d = 0; d < 4; d++) {
      int sy = i + dy[d];
      int sx = j + dx[d];
      if (0 <= sy && 0 <= sx && sy < H && sx < W) {
        if (S[i][j] != S[sy][sx] && !used[sy][sx]) {
          dfs(sy, sx);
        }
      }
    }
  }
}