import java.io.*
import java.util.*
import java.lang.*
import java.lang.Math.*


class GridBfs(val G: List<String>) {
    data class Pos(val x: Int, val y: Int)
    var H = G.size
    var W = G[0].length
    private val dx = intArrayOf(0,1,0,-1)
    private val dy = intArrayOf(1,0,-1,0)
    val vis = Array(H){BooleanArray(W){false}}

    fun count(SX: Int, SY: Int): Long {
        if (vis[SX][SY]) return 0L

        val que = ArrayDeque<Pos>()
        que.addLast(Pos(SX, SY))

        var black=0L; var white=0L

        while (que.isNotEmpty()) {
            val (x, y) = que.removeFirst()

            vis[x][y] = true
            if (G[x][y]=='#') black++
            else white++

            for(i in dx.indices) {
                val nx = x + dx[i]; val ny = y + dy[i]
                if (nx<0 || H<=nx || ny<0 || W<=ny) {
                    continue
                }
                if (G[nx][ny] == G[x][y]) {
                    continue
                }
                if (!vis[nx][ny]) {
                    que.push(Pos(nx, ny))
                    vis[nx][ny] = true
                }
            }
        }

        return black*white
    }
}

fun solve() {
    val (H, W) = rd.readListInt()
    val G = (0 until H).map { rd.readString() }

    val gbfs = GridBfs(G)

    var ans = 0L
    for (i in 0 until H) {
        for (j in 0 until W) {
            if (G[i][j] == '#') {
                ans += gbfs.count(i,j)
            }
        }
    }

    println(ans)
}


//val rd = debug.Reader("etc", "aising2019", "c", "sample-1")
val rd = Reader()


fun main(args: Array<String>) {
    try {
        var exception: Throwable? = null
        val sth = Thread(null, SolveThread(), "solveThread", 128 * 1024 * 1024)
        sth.setUncaughtExceptionHandler { _, e -> exception = e }
        sth.start(); sth.join()
        if (exception != null) throw exception!! }
    catch (e: Exception) { throw e }
    finally { rd.close() }
}
const val MOD = 1_000_000_007L; const val INF = Int.MAX_VALUE/2; const val LINF = Long.MAX_VALUE/2
const val EPS = 1e-9; fun DBLEQ(a: Double, b: Double): Boolean {return abs(a - b) < EPS}
data class IntPair(val first: Int, val second: Int)
data class To(val idx: Int, val cost: Long)
typealias ALI = ArrayList<Int>
fun <T>edge(V: Int): Array<ArrayList<T>> { return Array(V){ArrayList<T>()} }
val errPrintln: (Any) -> Unit = { msg -> System.err.println(msg) }
fun rAssert(exp: Boolean, lazyMsg: () -> String = {""}) {
    if (!exp) { val msg = lazyMsg(); errPrintln("EAssert Error: $msg"); throw Error(msg) }
}
fun tAssert(exp: Boolean, lazyMsg: () -> String = {""}) {
    if (!exp) { val msg = lazyMsg(); errPrintln("TAssert Error: $msg"); Thread.sleep(3000) }
}
class SolveThread : Runnable {
    override fun run() { solve() }
}
class Reader {
    private val br = BufferedReader(InputStreamReader(System.`in`))
    val readString: () -> String = { br.readLine() }
    val readInt: () -> Int = { br.readLine().toInt() }
    val readLong: () -> Long = { br.readLine().toLong() }
    val readIntArray: () -> IntArray = { br.readLine().split(' ').map { it.toInt() }.toIntArray() }
    val readLongArray: () -> LongArray = { br.readLine().split(' ').map { it.toLong() }.toLongArray() }
    val readListInt: () -> List<Int> = { br.readLine().split(' ').map { it.toInt() } }
    val readListLong: () -> List<Long> = { br.readLine().split(' ').map { it.toLong() } }
    val readListIntCol: (Int) -> List<Int> = { N -> (0 until N).map { readInt() } }
    val readListIntCols: (Int) -> List<List<Int>> = { N -> (0 until N).map { br.readLine().split(' ').map { it.toInt() } } }
    val readListLongCol: (Int) -> List<Long> = { N -> (0 until N).map { readLong() } }
    val readListLongCols: (Int) -> List<List<Long>> = { N -> (0 until N).map { br.readLine().split(' ').map { it.toLong() } } }
    val close: () -> Unit = { br.close() }
    protected fun finalize() { close() }
}
