#include<iostream>
#include<climits>
using namespace std;
int n,m,ans=INT_MAX;
char s[121][121];
int dx[4]={0,-1,0,1};
int dy[4]={-1,0,1,0};
void dfs(int x,int y,int step){
    if(x==n&&y==m){
        if(step<ans)ans=step;
    return;
        
    }
    if(step>=ans)return;
    s[x][y]='#';
    for(int i=0;i<4;i++){
        int tx=x+dx[i];
        int ty=y+dy[i];
        if(tx>=1&&tx<=n&&ty>=1&&ty<=m&&s[tx][ty]=='.'){
            dfs(tx,ty,step+1);
            
        }
        
    }
    s[x][y]='.';
    
}
    int main(){
    cin>>n>>m;
    for(int i=1;i<=n;i++){
    for(int j=1;j<=m;j++){
        cin>>s[i][j];
        
    }
        
    }
    dfs(1,1,1);
    cout<<ans;
    return 0;
        
    }
/**************************************************************
	Problem: 1432
	User: zhengzihao
	Language: C++
	Result: Time Limit Exceed
****************************************************************/