#include<bits/stdc++.h>
using namespace std;
int n,m;
int fx[4]={0,1,0,-1};
int fy[4]={1,0,-1,0};
char a[42][42];
int b[42][42];
void dfs(int x,int y,int k){
    b[x][y]=k;
	for(int i=0;i<=3;i++){
		int tx=x+fx[i];
		int ty=y+fy[i];
		if(tx>=1&&tx<=n&&ty>=1&&ty<=m&&a[tx][ty]=='.'&&k+1<b[tx][ty]){
			dfs(tx,ty,k+1);//k=k+1 
		}
	}
}
int main(){
    cin>>n>>m;
    for(int i=1;i<=n;i++){
    	for(int j=1;j<=m;j++){
    		cin>>a[i][j];
    		b[i][j]=INT_MAX;
    	}
    }
    dfs(1,1,1);
//    for(int i=1;i<=n;i++){
//    	for(int j=1;j<=m;j++){
//    		cout<<b[i][j]<<" ";
//    	}
//    	cout<<endl;
//    }
    cout<<b[n][m];
	return 0;
}

/**************************************************************
	Problem: 1432
	User: chenjingqi
	Language: C++
	Result: Accepted
	Time:29 ms
	Memory:2080 kb
****************************************************************/