//雪花飄飄北風嘯嘯
//天地一片蒼茫

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,ll>
#define fi first
#define se second
#define endl '\n'
#define debug(x) cout << #x << " is " << x << endl

#define rep(x,start,end) for(auto x=(start)-((start)>(end));x!=(end)-((start)>(end));((start)<(end)?x++:x--))
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()

#define indexed_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
//change less to less_equal for non distinct pbds, but erase will bug

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());

int n,m;
string grid[105];

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin.exceptions(ios::badbit | ios::failbit);
	
	cin>>n>>m;
	rep(x,0,n) cin>>grid[x];
	
	int ans=0;
	
	rep(x,0,n-1){
		rep(y,0,m) if (grid[x][y]=='.' && grid[x+1][y]=='.') ans++;
	}
	
	rep(x,0,n){
		rep(y,0,m-1) if (grid[x][y]=='.' && grid[x][y+1]=='.') ans++;
	}
	
	cout<<ans<<endl;
}

#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int dx[4]={1,-1,0,0};
int dy[4]={0,0,1,-1};
int main(void){
    int h,w,ans=0;
    cin >> h >> w;
    char m[h][w];
    rep(i,h)rep(j,w) cin >> m[i][j];
    rep(i,h)rep(j,w){
        if(m[i][j]=='#') continue;
        rep(k,4){
            int nowx = i+dx[k],nowy = j+dy[k];
            if(nowx<0||h<=nowx||nowy<0||w<=nowy) continue;
            if(m[nowx][nowy]=='.') ans++;
        }
    }
    cout << ans/2 << endl;
}
