#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#include <tuple>
#include <iomanip>
#include <numeric>
#include <unordered_map>
#include <sstream>
#include<limits.h>
#include<float.h>
#include<list>
#include <array>
#include <complex>
#include<stdio.h>
#include<string.h>
#include <bitset>

using namespace std;
#define int long long

#define I32_MAX 2147483647
#define I64_MAX 9223372036854775807LL
#define I64_MAX2 1223372036854775807LL
#define INF I64_MAX2
#define MOD 1000000007
#define MEM_SIZE 10000
#define DEBUG_OUT true
#define ALL(x) (x).begin(), (x).end()

template<typename T> void DEBUG(T e){if(DEBUG_OUT == false)return; std::cout << e <<" ";}
template<typename T> void DEBUG(const std::vector<T>& v){if(DEBUG_OUT == false)return;for(const auto& e : v){std::cout<< e << " "; } std::cout << std::endl;}
template<typename T> void DEBUG(const std::vector<std::vector<T> >& vv){if(DEBUG_OUT == false)return;for(const auto& v : vv){ DEBUG(v); } }
template<class T,class... Ts> void DEBUG(T d, Ts... e){if(DEBUG_OUT == false)return;DEBUG(d);DEBUG(e...);}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; abort();}}
template< typename T1, typename T2 > inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
template< typename T1, typename T2 > inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }
//SOLVE

//-----CODE------//
void DFS(int V,vector<vector<int> > &GRAPH,vector<int> & visited,vector<vector<char> > & mat,int & nB,int &nW,int WIDTH)
{
  if(mat[V/WIDTH][V%WIDTH] == '.')nW++;
  else nB++;
  visited[V] = 1;
  for (auto &&nV : GRAPH[V])
  {
    if(visited[nV] == 1)continue;
    DFS(nV,GRAPH,visited,mat,nB,nW,WIDTH);
  }
  return;
}
//-----CODE------//
void solve(void)
{ 
  int H,W; cin>>H; cin>>W; 
  vector<vector<char> >  mat (H,vector<char>(W,0));
  for (int i = 0; i < H; i++)
  {
    for (int j = 0; j < W; j++)
    {
       cin>>mat[i][j];
    }
  }
  int N = H*W;
  vector<vector<int> > GRAPH (H*W);
  for (int i = 0; i < H; i++)
  {
    for (int j = 0; j < W; j++)
    {
      if(i != 0)
      {
        if(mat[i][j] != mat[i-1][j])
        {
          int V = i*W + j;
          int nV = (i-1)*W+j;
          GRAPH[V].emplace_back(nV);
          GRAPH[nV].emplace_back(V);
        }
      }
      if(i != H - 1)
      {
        if(mat[i][j] != mat[i+1][j])
        {
          int V = i*W + j;
          int nV = (i+1)*W+j;
          GRAPH[V].emplace_back(nV);
          GRAPH[nV].emplace_back(V);
        }
      }
      if(j != 0)
      {
        if(mat[i][j] != mat[i][j-1])
        {
          int V = i*W + j;
          int nV = (i)*W+j-1;
          GRAPH[V].emplace_back(nV);
          GRAPH[nV].emplace_back(V);
        }
      }
      if(j != W -1)
      {
        if(mat[i][j] != mat[i][j+1])
        {
          int V = i*W + j;
          int nV = (i)*W+j+1;
          GRAPH[V].emplace_back(nV);
          GRAPH[nV].emplace_back(V);
        }
      }

    }

  }
  vector<int> visited (H*W,-1);
  int ANS = 0;
  for (int i = 0; i < H*W; i++)
  {
    int V = i;
    int nB = 0;
    int nW = 0;
    DFS(V,GRAPH,visited,mat,nB,nW,W);
    ANS += nB * nW;
  }
  cout<<ANS<<endl;
  
  
  return;
}
int32_t main(int32_t argc, const char *argv[])
{
  std::ios::sync_with_stdio(false);
  std::cin.tie(0);

  std::cout << std::fixed;
  std::cout << std::setprecision(9);
  solve();

  return 0;
}

#include <string>
#include <vector>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <map>
#include <list>
#include <set>
#include <numeric>
#include <queue>
#include <stack>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <climits>
#include <cfloat>
#include <ctime>
#include <complex>
#include <cassert>
#include <array>
#include <bitset> 
#include <unordered_map>
#include <random>
using namespace std;
typedef long long LL;
typedef double T;
typedef pair<T,T> P;

double pi;
// difference
P operator-(const P& lhs, const P& rhs)
{
	return P(lhs.first-rhs.first,lhs.second-rhs.second);
}

P operator+(const P& lhs, const P& rhs)
{
	return P(lhs.first+rhs.first, lhs.second+rhs.second);
}

P full(0,1);
P one(1,1);
P f(P a, P b)
{
	if(a==full){
		return b;
	}
	if(a.first+0.5<b.first){
		b=b-one;
	}
	if(b.first+0.5<a.first){
		a=a-one;
	}
	P r=P(max(a.first,b.first),min(a.second,b.second));
	if(r.first<0){
		r=r+one;
	}
	return r;
}
P ps[100];
int main(){
	pi=atan2(0,-1);
    long long N;
    scanf("%lld",&N);
    for(int i = 0 ; i < N ; i++){
		double x,y;
        scanf("%lf",&x);
        scanf("%lf",&y);
		ps[i]=P(x,y);
    }

	for(int i=0;i<N;i++){
		P r=full;
		bool zero=false;
		for(int j=0;j<N;j++){
			if(i==j)continue;
			auto v=ps[j]-ps[i];
			auto c=atan2(v.second,v.first)/(2*pi);
			P p(c-0.25,c+0.25);
			while(p.first<0){
				p=p+one;
			}
			r=f(r,p);
			//cerr << i << ", " << j << ": " << p.first << ", " << p.second << ": " << r.first << ", " << r.second << ": " << v.first << ", " << v.second << ": " << c << endl;
			//cerr << atan2(v.second,v.first) << ", " << pi << endl;
			if(r.first>=r.second){
				zero=true;
				break;
			}
		}
		if(zero){
			cout << 0 << endl;
		}
		else{
			cout << r.second-r.first << endl;
		}
	}

    return 0;
}
