//2008A Dennis
#include <iostream>
#include <string>
using namespace std;
const int MAXINT=2147483647;
const int MAZESIZE=100;
const int WALL=-1;

int maze[MAZESIZE][MAZESIZE];

void getMaze(int maze[][MAZESIZE],int rows,int cols)
{
	string str;
	for (int r=0;r<rows;r++)
	{
		cin>>str;
		for (int c=0;c<cols;c++) 
			if (str[c]=='.') maze[r][c]=MAXINT;
			else maze[r][c]=WALL;		
	}
}

//next step
int goMaze(int maze[][MAZESIZE],int rows,int cols,int path=1,int rowstart=0,int colstart=0,int minpath=MAXINT)
{
	if (colstart>=cols || rowstart>=rows || colstart<0 || rowstart<0 || //out of bounds
		maze[rowstart][colstart]==WALL ||				//wall
		path>=minpath ||								//a shorter path already found
		path>=maze[rowstart][colstart]) return minpath;	//a shorter path was already found for this location, back away!

	if (rowstart==rows-1 && colstart==cols-1)	//reached the end of maze
	{
		if (path<minpath) return path;
		else return minpath;
	}

	maze[rowstart][colstart]=path;				//mark our path
	
	minpath=goMaze(maze,rows,cols,path+1,rowstart,colstart+1,minpath);//go right
	minpath=goMaze(maze,rows,cols,path+1,rowstart+1,colstart,minpath);//go down
	minpath=goMaze(maze,rows,cols,path+1,rowstart,colstart-1,minpath);//go left
	minpath=goMaze(maze,rows,cols,path+1,rowstart-1,colstart,minpath);//go up

	return minpath;
}

int main()
{
	int row,col;
	while(cin>>row>>col && row!=0)
	{
		getMaze(maze,row,col);
		cout<<goMaze(maze,row,col)<<endl;
	}

	return 0;
}


/*
4 7
..#....
#...##.
#.####.
#......
2 3
..#
#..
0 0
*/

//How:  simple recursion with some bounding.