#include<bits/stdc++.h>
#define fi first
#define se second
#define db double
#define U unsigned
#define P pair<int,int>
#define int long long
#define pb push_back
#define MP make_pair
#define all(x) x.begin(),x.end()
#define CLR(i,a) memset(i,a,sizeof(i))
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define ROF(i,a,b) for(int i=a;i>=b;i--)
#define debug(x) cerr<<#x<<'='<<x<<endl
#define MIN(a,b) ((a)<(b)?(a):(b))
#define MAX(a,b) ((a)>(b)?(a):(b))
#define gc getchar()
#define pc putchar
using namespace std;
inline int rd(){
    int x=0,f=1; 
    char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-') f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9') x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
    return x*f;
}   
inline void wr(int x){
    if(x<0) x=-x;
    if(x>9) wr(x/10);
    pc((x%10)^48);
}
char a[1005][1005];
bool fl[1005][1005];
int n,m;
bool slove(int x,int y){
	if(x<1||x>n||y<1||y>m||fl[x][y]) return 0;
	if(a[x][y]=='.' &&a[x][y+1]=='.'&&a[x+3][y]=='.'&&a[x+3][y+1]=='.'){
        FOR(i,x+1,x+2){
            FOR(j,y-1,y+2){
				if(a[i][j]=='#') return 0;
			}
		}
		if(a[x-1][y]=='.'||a[x-1][y+1]=='.'||a[x][y+2]=='.'||a[x][y-1]=='.'||a[x+1][y-2]=='.'||a[x+1][y+3]=='.'||a[x+2][y-2]=='.'||a[x+2][y+3]=='.'||a[x+3][y-1]=='.'||a[x+3][y+2]=='.'||a[x+4][y]=='.'||a[x+4][y+1]=='.')
			return 0;
		fl[x][y]=1,fl[x][y+1]=1,fl[x+3][y]=1,fl[x+3][y+1]=1;
        FOR(i,x+1,x+2){
            FOR(j,y-1,y+2){
				fl[i][j]=1;
			}
		}
		return 1;
	}
	return 0;
}
int type_c,type_s;
signed main(){
    cin>>n>>m;
    FOR(i,1,n){
        FOR(j,1,m) cin>>a[i][j];
	}
    FOR(i,1,n){
        FOR(j,1,m){
			if(a[i][j]=='.'){
				if(slove(i,j)){
					if(slove(i-7,j)||slove(i,j+7)||slove(i+7,j)||slove(i,j-7)) type_c++;
					else type_s++;
				}
			}
		}
	}
	cout<<type_c<<' '<<type_s;
	return 0;
}