h,w=gets.chomp.split(" ").map { |e| e.to_i }
s=[]
h.times do |i|
  s[i] = gets.chomp.split("")
end

$dp = Array.new(h).map { Array.new(w,0)}

def judge(i, j, h, w)
  if 0 <= i && i <= h-1 && 0 <= j && j<= w-1
    return true
  else
    return false
  end
end

def bfs(s, i, j, h, w)
  queue = [[i,j]]
  $dp[i][j] = 1
  ary = [[1, 0],[-1, 0],[0, 1],[0, -1]]
  white = 0
  black = 1

  until queue.empty?
    temp = queue.pop
    x = temp[0]
    y = temp[1]

    for a in ary do
      if judge(x+a[0], y+a[1], h, w)
        if $dp[x+a[0]][y+a[1]] == 0 && s[x][y] != s[x+a[0]][y+a[1]]
          queue.push([x+a[0],y+a[1]])
          $dp[x+a[0]][y+a[1]] = 1
          if s[x+a[0]][y+a[1]] == "#"
            black += 1
          else
            white += 1
          end
        end
      end
    end
  end
  return black*white
end

ans = 0

for i in 0..h-1 do
  for j in 0..w-1 do
    if $dp[i][j] == 0 && s[i][j] == "#"
      ans += bfs(s, i, j, h, w)
    end
  end
end

puts ans
