/*
MST，建图略麻烦
*/
#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
#define ll long long
#define fo(i,l,r) for(int i = l;i <= r;i++)
#define fd(i,l,r) for(int i = r;i >= l;i--)
using namespace std;
const int N = 25005;
ll read(){ll 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*10+(ch-'0');ch=getchar();};return x*f;
}
struct edge{int u;int v;int w;friend bool operator < (edge a,edge b){return a.w < b.w;}
}e[N*3];
int n,m,fa[N];
char mp[105][105];
int cnt,ans1,ans2,ans3;
bool judge(int y,int x){if(y < 1 || y > n || x < 1 || x > m || mp[y][x] != '#') return false;return true;
}
void input(){n =read();m =read();char tmp;fo(i,1,n){fo(j,1,m){tmp = getchar();while(tmp !='.' && tmp != '#') tmp = getchar();mp[i][j] = tmp;if(tmp == '#') ans1++;}}
}
inline int jdz(int x){if(x<0)x=-x;return x;
}
inline void ins(int y1,int x1,int y2,int x2){cnt++;e[cnt].u = (y1-1)*m + x1;e[cnt].v = (y2-1)*m + x2;e[cnt].w = jdz(y1-y2) + jdz(x1-x2);if(y1 != y2) e[cnt].w--;if(x1 != x2) e[cnt].w--;//cout<<y1<<" "<<x1<<" "<<y2<<" "<<x2<<" "<<e[cnt].w<<endl;
}
void build(){fo(i,1,n){fo(j,1,m){if(mp[i][j] != '#') continue;fo(k,j+1,m){if(judge(i,k)) ins(i,j,i,k);if(judge(i+1,k)) ins(i,j,i+1,k);if(judge(i-1,k)) ins(i,j,i-1,k);}fo(k,i+1,n){if(judge(k,j)) ins(i,j,k,j);if(judge(k,j+1)) ins(i,j,k,j+1);if(judge(k,j-1)) ins(i,j,k,j-1);}}}}
int findf(int x){return x == fa[x] ? x : fa[x] = findf(fa[x]);
}
void mst(){sort(e+1,e+1+cnt);fo(i,1,N-10) fa[i] = i;int u,v;fo(i,1,cnt){u = e[i].u;v = e[i].v;u = findf(u);v = findf(v);if(u != v){fa[u] = v;if(!e[i].w)ans1--;if(e[i].w)ans2++;ans3 += e[i].w;}}cout<<ans1<<endl<<ans2<<" "<<ans3;
}
int main(){input();build();mst();return 0;
}