#include<iostream>
#define f cin
#define g cout
#define N 110
using namespace std;
int a[N][N],i,n,m,j,best;
char s[N][N];
int main ()
{
	freopen("a.in","r",stdin);
	f>>n>>m;
	for(i=1;i<=n;++i)
		f>>(s[i]+1);
	a[1][1]=1;
	for(i=1;i<=n;++i)
		for(j=1;j<=m;++j)
		{
			if(a[i][j]||s[i][j]=='&')
				continue;
			if(a[i-1][j]&&s[i-1][j]!='&')
				a[i][j]=a[i-1][j]+1;
			if(a[i][j-1]&&s[i][j-1]!='&')
				a[i][j]=max(a[i][j],a[i][j-1]+1);
			if(a[i][j]>best)
				best=a[i][j];
		}
	g<<best;
	return 0;
}